From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

Topics in Graph Theory: Graphs and Their Cartesian Product

Science & Math

Imrich, Wilfried

Klavžar, Sandi

Rall, Douglas F

Mathematics

A K Peters/CRC Press

A comprehensive introduction to the four standard products of graphs and related topics Addressing the growing usefulness of current methods for recognizing product graphs, this new work presents a much-needed, systematic treatment of the Cartesian, strong, direct, and lexicographic products of graphs as well as graphs isometrically embedded into them. Written by two leading experts in this rapidly evolving area of combinatorics, Product Graphs: Structure and Recognition compiles and consolidates a wealth of information previously scattered throughout the literature, providing researchers in the field with ready access to numerous recent results as well as several new recognition algorithms and proofs. The authors explain all topics from the ground up and make the requisite theory and data structures easily accessible for mathematicians and computer scientists alike. Coverage includes * The basic algebraic and combinatorial properties ofproduct graph * Hypercubes, median graphs, Hamming graphs, triangle-free graphs, and vertex-transitive graphs * Colorings, automorphisms, homorphisms, domination, and the capacity of products of graphs Sample applications, including novel applications to chemical graph theory Clear connections to other areas of graph theory Figures, exercises, and hundreds of references

Product Graphs: Structure and Recognition

Computers & Technology

Graphics & Design

Wiley-Interscience

The Tower of Hanoi – Myths and Maths

Hinz, Andreas M.

Petr, Ciril

Programming

Birkhauser

<div> This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate research on closely related topics, establishing a key reference for future developments.&nbsp; The crux of the discussion surrounds new methods and ideas that were developed within the theory, led by the imagination strategy, the Continuation Principle, and the discharging method of Bujtás, to prove results about domination game invariants. A toolbox of proof techniques is provided for the reader to obtain results on the domination game and its variants.&nbsp; Powerful proof methods such as the imagination strategy are presented.&nbsp; The Continuation Principle is developed, which provides a much-used monotonicity property of the game domination number.&nbsp; In addition, the reader is exposed to the discharging method of Bujtás. The power of this method was shown by improving the known upper bound, in terms of a graph's order, on the (ordinary) domination number of graphs with minimum degree between 5 and 50.&nbsp;The book is intended primarily for students in graph theory as well as established graph theorists and it can be enjoyed by anyone with a modicum of mathematical maturity. The authors include exact results for several families of graphs, present what is known about the domination game played on subgraphs and trees, and provide the reader with the computational complexity aspects of domination games.&nbsp; Versions of the games which involve only the "slow" player yield the Grundy domination numbers, which connect the topic of the book with some concepts from linear algebra such as zero-forcing sets and minimum rank.&nbsp; More than a dozen other related games on graphs and hypergraphs are presented in the book.&nbsp; In all these games there are problems waiting to be solved, so the area is rich for further research.&nbsp; The domination game belongs to the growing family of competitive optimization graph games. &nbsp;The game is played by two competitors who take turns adding a vertex to a set of chosen vertices. &nbsp;They collaboratively produce a special structure in the underlying host graph, namely a dominating set.&nbsp; The two players have complementary goals: one seeks to minimize the size of the chosen set while the other player tries to make it as large as possible.&nbsp; The game is not one that is either won or lost.&nbsp; Instead, if both players employ an optimal strategy that is consistent with their goals, the cardinality of the chosen set is a graphical invariant, called the game domination number of the graph.&nbsp; To demonstrate that this is indeed a graphical invariant, the&nbsp;game tree of a domination game played on a graph is presented for the first time in the literature.&nbsp; </div> <div> </div>

Domination Games Played on Graphs (SpringerBriefs in Mathematics)

Henning, Michael A.

Brešar, Boštjan

Springer

This is the first comprehensive monograph on the mathematical theory of the solitaire game “The Tower of Hanoi” which was invented in the 19th century by the French number theorist Édouard Lucas. The book comprises a survey of the historical development from the game’s predecessors up to recent research in mathematics and applications in computer science and psychology. Apart from long-standing myths it contains a thorough, largely self-contained presentation of the essential mathematical facts with complete proofs, including also unpublished material. The main objects of research today are the so-called Hanoi graphs and the related Sierpiński graphs. Acknowledging the great popularity of the topic in computer science, algorithms and their correctness proofs form an essential part of the book. In view of the most important practical applications of the Tower of Hanoi and its variants, namely in physics, network theory, and cognitive (neuro)psychology, other related structures and puzzles like, e.g., the “Tower of London”, are addressed. Numerous captivating integer sequences arise along the way, but also many open questions impose themselves. Central among these is the famed Frame-Stewart conjecture. Despite many attempts to decide it and large-scale numerical experiments supporting its truth, it remains unsettled after more than 70 years and thus demonstrates the timeliness of the topic. Enriched with elaborate illustrations, connections to other puzzles and challenges for the reader in the form of (solved) exercises as well as problems for further exploration, this book is enjoyable reading for students, educators, game enthusiasts and researchers alike.

Milutinović, Uroš

Hinz, Andreas M. M.

The solitaire game “The Tower of Hanoi" was invented in the 19th century by the French number theorist Édouard Lucas. The book presents its mathematical theory and offers a survey of the historical development from predecessors up to recent research. In addition to long-standing myths, it provides a detailed overview of the essential mathematical facts with complete proofs, and also includes unpublished material, e.g., on some captivating integer sequences. The main objects of research today are the so-called Hanoi graphs and the related Sierpiński graphs. Acknowledging the great popularity of the topic in computer science, algorithms, together with their correctness proofs, form an essential part of the book. In view of the most important practical applications, namely in physics, network theory and cognitive (neuro)psychology, the book also addresses other structures related to the Tower of Hanoi and its variants.
The updated second edition includes, for the first time in English, the breakthrough reached with the solution of the “The Reve's Puzzle" in 2014. This is a special case of the famed Frame-Stewart conjecture which is still open after more than 75 years. Enriched with elaborate illustrations, connections to other puzzles and challenges for the reader in the form of (solved) exercises as well as problems for further exploration, this book is enjoyable reading for students, educators, game enthusiasts and researchers alike.
Excerpts from reviews of the first edition:
“The book is an unusual, but very welcome, form of mathematical writing: recreational mathematics taken seriously and serious mathematics treated historically. I don’t hesitate to recommend this book to students, professional research mathematicians, teachers, and to readers of popular mathematics who enjoy more technical expository detail.”
Chris Sangwin, The Mathematical Intelligencer 37(4) (2015) 87f.
“The book demonstrates that the Tower of Hanoi has a very rich mathematical structure, and as soon as we tweak the parameters we surprisingly quickly find ourselves in the realm of open problems.”
László Kozma, ACM SIGACT News 45(3) (2014) 34ff.
“Each time I open the book I discover a renewed interest in the Tower of Hanoi. I am sure that this will be the case for all readers.”
Jean-Paul Allouche, Newsletter of the European Mathematical Society 93 (2014) 56.

Fibonacci Cubes With Applications And Variations

Eğecioğlu, Ömer

Mollard, Michel

Computer Science

WSPC

See the best price to sell, buy, or rent books by Klavžar, Sandi. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Klavžar, Sandi