Handbook of product graphs

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

Descripción completa

Detalles Bibliográficos
Autor principal: Hammack, Richard H. (-)
Otros Autores: Imrich, Wilfried, 1941-, Klavzar, Sandi, 1962-
Formato: Libro electrónico
Idioma:Inglés
Publicado: Boca Raton, FL : CRC Press c2011.
Edición:2nd ed
Colección:Discrete mathematics and its applications.
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627978106719
Tabla de Contenidos:
  • Front Cover; Contents; Foreword; Preface; I. A Brief Introduction to Graphs and Their Products; 1. Graphs; 2. Automorphisms and Invariants; 3. Hypercubes and Isometric Subgraphs; 4. Graph Products; 5. The Four Standard Graph Products; II. Factorization and Cancellation; 6. Cartesian Product; 7. Strong Product; 8. Direct Product; 9. Cancellation; 10. Lexicographic Product; III. Isometric Embeddings; 11. The Relation Θ and Partial Cubes; 12. Median Graphs; 13. The Canonical Isometric Embedding; 14. A Dynamic Location Problem; 15. Isometries in Strong Products and Product Dimensions
  • 16. Fixed Box TheoremsIV. Algorithms; 17. Graph Representation and Algorithms; 18. Recognizing Hypercubes and Partial Cubes; 19. Chemical Graphs and the Wiener Index; 20. Arboricity, Squares, and Triangles; 21. Recognizing Median Graphs; 22. Recognizing Partial Hamming Graphs and Quasi-Median Graphs; 23. Factoring the Cartesian Product; 24. Recognizing Direct, Strong, and Lexicographic Products; V. Invariants; 25. Connectivity; 26. Coloring and Hedetniemi's Conjecture; 27. Independence Number and Shannon Capacity; 28. Domination and Vizing's Conjecture; 29. Cycle Spaces and Bases
  • 30. Selected ResultsVI. Related Concepts; 31. Infinite Graphs; 32. Products of Digraphs; 33. Near Products; Appendix: Hints and Solutions to Exercises; Bibliography