Mehr lesen
Zusatztext 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 Klavzar. 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 Klavzar 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 Informationen zum Autor 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. Klappentext This handbook 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, this second edition presents full proofs of many important results as well as up-to-date research and conjectures. It illustrates applications of graph products in several areas and contains well over 300 exercises. Supplementary material is available on the book's website. Zusammenfassung 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 Verific...
