Handbook of Product Graphs

Author:   Richard Hammack (Virginia Commonwealth University, Richmond, USA) ,  Wilfried Imrich (Montanuniversität Leoben, Austria) ,  Sandi Klavžar (University of Ljubljana and University of Maribor, Slovenia)
Publisher:   Taylor & Francis Inc
Edition:   2nd edition
Volume:   66
ISBN:  

9781439813041


Pages:   536
Publication Date:   06 June 2011
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $326.00 Quantity:  
Add to Cart

Share |

Handbook of Product Graphs


Add your own review!

Overview

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.

Full Product Details

Author:   Richard Hammack (Virginia Commonwealth University, Richmond, USA) ,  Wilfried Imrich (Montanuniversität Leoben, Austria) ,  Sandi Klavžar (University of Ljubljana and University of Maribor, Slovenia)
Publisher:   Taylor & Francis Inc
Imprint:   CRC Press Inc
Edition:   2nd edition
Volume:   66
Weight:   1.150kg
ISBN:  

9781439813041


ISBN 10:   1439813043
Pages:   536
Publication Date:   06 June 2011
Audience:   College/higher education ,  General/trade ,  Tertiary & Higher Education ,  General
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

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 KlavA 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 KlavA 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


Author Information

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 Montanuniversitat 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 Klavzar 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. Klavzar 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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List