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 Ltd
Imprint: CRC Press
Edition: 2nd edition
Weight: 0.453kg
ISBN: 9781138199088
ISBN 10: 1138199087
Pages: 536
Publication Date: 16 November 2016
Audience:
College/higher education
,
General/trade
,
Tertiary & Higher Education
,
General
Format: Paperback
Publisher's Status: Active
Availability: In Print
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.
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 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
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 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.
