Cantitate/Preț
Produs
Total produse
Vezi coșul
Handbook of Product Graphs de Richard Hammack

Handbook of Product Graphs: Discrete Mathematics and Its Applications

Autor Richard Hammack, Wilfried Imrich, Sandi Klavžar
en Limba Engleză Hardback – 6 iun 2011
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 46934 lei  6-8 săpt.
  CRC Press – 16 noi 2016 46934 lei  6-8 săpt.
Hardback (1) 113343 lei  6-8 săpt.
  CRC Press – 6 iun 2011 113343 lei  6-8 săpt.

Din seria Discrete Mathematics and Its Applications

Preț: 113343 lei

Preț vechi: 138223 lei
-18% Nou

Puncte Express: 1700
Preț estimativ în valută:
21694€ • 22562$ • 18179£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781439813041
ISBN-10: 1439813043
Pagini: 536
Ilustrații: 75 Illustrations, black and white
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.14 kg
Ediția:Revizuită
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications

Public țintă

Researchers and graduate students in mathematics, computer science, chemistry, and physics.

Cuprins

A Brief Introduction to Graphs and Their Products. Factorization and Cancellation. Isometric Embeddings. Algorithms. Invariants. Related Concepts. Appendix. Bibliography. Indices.

Notă biografică

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.

Recenzii

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

Descriere

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.