Handbook of Product Graphs - Discrete Mathematics and Its Applications (Hardback)
  • Handbook of Product Graphs - Discrete Mathematics and Its Applications (Hardback)

Handbook of Product Graphs - Discrete Mathematics and Its Applications (Hardback)

(author), (author), (author)
Hardback 536 Pages / Published: 06/06/2011
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

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.

Publisher: Taylor & Francis Inc
ISBN: 9781439813041
Number of pages: 536
Weight: 1179 g
Dimensions: 254 x 178 mm
Edition: 2nd New edition


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

You may also be interested in...

Graph Theory As I Have Known It
Added to basket
Subdivision Surfaces
Added to basket
Introduction to Graph Theory
Added to basket
Modern Graph Theory
Added to basket
A First Course in Network Theory
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Graph Theory
Added to basket
Discrete Mathematics
Added to basket
Matroids: A Geometric Introduction
Added to basket

Please sign in to write a review

Your review has been submitted successfully.