Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition by Richard Hammack (PDF)

Description

Handbook of Product Graphs, Second Edition examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, the handbook presents full proofs of many important results as well as up-to-date research and conjectures.Results and Algorithms New to the Second Edition:Cancellation results A quadratic recognition algorithm for partial cubes Results on the strong isometric dimension Computing the Wiener index via canonical isometric embedding Connectivity results A fractional version of Hedetniemi’s conjecture Results on the independence number of Cartesian powers of vertex-transitive graphs Verification of Vizing’s conjecture for chordal graphs Results on minimum cycle bases Numerous selected recent results, such as complete minors and nowhere-zero flows The second edition of this classic handbook provides a thorough introduction to the subject and an extensive survey of the field. The first three parts of the book cover graph products in detail. The authors discuss algebraic properties, such as factorization and cancellation, and explore interesting and important classes of subgraphs. The fourth part presents algorithms for the recognition of products and related classes of graphs. The final two parts focus on graph invariants and infinite, directed, and product-like graphs. Sample implementations of selected algorithms and other information are available on the book’s website, which can be reached via the authors’ home pages.

User’s Reviews

Editorial Reviews: Review It is my pleasure to introduce you to the marvelous world of graph products, as presented by three experts in a hugely expanded and updated edition of the classic by Imrich and Klavžar. This version, really a new book (thirty-three chapters, up from nine!), contains streamlined proofs, new applications, solutions to conjectures (such as Vizing’s conjecture for chordal graphs), and new results in graph minors and flows. Every graph theorist, most combinatorialists, and many other mathematicians will want this volume in their collection. …The authors have paid careful attention to algorithmic issues (indeed, many of the most attractive algorithms are products of their own research). Readers will find a gentle but incisive introduction to graph algorithms here, and a persuasive lesson on the insights to be gained by algorithmic analysis. In sum―and product―Hammack, Imrich, and Klavžar have put together a world of elegant and useful results in a cogent, readable text. The old book was already a delight, and you will want the new one in an accessible place on your bookshelf.―From the Foreword by Peter Winkler, Dartmouth College, Hanover, New Hampshire, USA About the Author Richard Hammack is an associate professor in the Department of Mathematics and Applied Mathematics at Virginia Commonwealth University. Dr. Hammack is a member of the American Mathematical Society, the Mathematical Association of America, and the Institute of Combinatorics and its Applications. He earned a Ph.D. in mathematics from the University of North Carolina at Chapel Hill.Wilfried Imrich is professor emeritus in the Department of Mathematics and Information Technology at Montanuniversität Leoben. His research interests include the structure of finite and infinite graphs, graph automorphisms, combinatorial group theory, and graph algorithms. Dr. Imrich earned a Ph.D. from the University of Vienna.Sandi Klavžar is a professor in the Faculty of Mathematics and Physics at the University of Ljubljana and in the Faculty of Natural Sciences and Math at the University of Maribor. Dr. Klavžar is an editorial board member of Ars Mathematica Contemporanea, Asian-European Journal of Mathematics, Discussiones Mathematicae Graph Theory, European Journal of Combinatorics, and MATCH Communications in Mathematical and in Computer Chemistry.

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐This is the book that I had thought experts like Richard Hammack, Wilfried Imrich and Sandi Klavzar would be able to write, and since the trio has few competitors in this discipline, I am delighted to see that I thought just right. The book derives its strength and excellence from the fact that the authors speak from their hearts, since they have a crystallized understanding of all aspects of product graphs. Indeed, a number of major results in the book have been obtained by the authors themselves. For most others, they have stood as mentors, troubleshooters, referees and reviewers.Product graphs have numerous applications in varied areas like mathematics, engineering, computer science, chemistry, sociology and operations research. This book contains a large number of motivating examples, well-written proofs, exercises and their solutions, and an up-to-date bibliography. I strongly believe that it will be an asset to most everyone in discrete mathematics, computer science and related disciplines.

Keywords

Free Download Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition in PDF format
Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition PDF Free Download
Download Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition 2011 PDF Free
Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition 2011 PDF Free Download
Download Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition PDF
Free Download Ebook Handbook of Product Graphs (Discrete Mathematics and Its Applications) 2nd Edition