You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
Graphs and Networks A unique blend of graph theory and network science for mathematicians and data science professionals alike. Featuring topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings, Graphs and Networks contains modern applications for graph theorists and a host of useful theorems for network scientists. The book begins with applications to biology and the social and political sciences and gradually takes a more theoretical direction toward graph structure theor...
This collection will give students (high school or beyond), teachers, and university professors a chance to experience the pleasure of wrestling with some beautiful problems of elementary mathematics. Readers can compare their sleuthing talents with those of Sherlock Holmes, who made a bad mistake regarding the first problem in the collection: Determine the direction of travel of a bicycle that has left its tracks in a patch of mud. Which Way did the Bicycle Go? contains a variety of other unusual and interesting problems in geometry, algebra, combinatorics, and number theory. For example, if a pizza is sliced into eight 45degree wedges meeting at a point other than the center of the pizza, and two people eat alternate wedges, will they get equal amounts of pizza? Or: What is the rightmost nonzero digit of the product $1cdot 2cdot 3cdots 1,000,000$? Or: Is a manufacturer's claim that a certain unusual combination lock allows thousands of combinations justified? Complete solutions to the 191 problems are included along with problem variations and topics for investigation.
Written by two prominent figures in the field, this comprehensive text provides a remarkably student-friendly approach. Its sound yet accessible treatment emphasizes the history of graph theory and offers unique examples and lucid proofs. 2004 edition.
This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica® is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective techniques for solving practical problems via computer implementation. The book is designed with three primary readerships in mind. Individual syllabi or suggested sequences for study are provided for each of three student audiences: mathematics, applied mathematics/operations research, and computer science. In addition to the visual appeal of each page, the text contains an abundance of gems. Most ...
With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways. The textbook also covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings. Features of the Second Edition: The book can be used for a first course in graph theory as well as a graduate course The primary topic in the book is graph coloring The book begins with an introduction to graph theory so assumes no previous course The authors are the most widely-published team on graph theory Many new examples and exercises enhance the new edition