|
![]() |
|||
|
||||
OverviewA comprehensive introduction to the four standard products of graphs and related topics Addressing the growing usefulness of current methods for recognizing product graphs, this new work presents a much--needed, systematic treatment of the Cartesian, strong, direct, and lexicographic products of graphs as well as graphs isometrically embedded into them. Written by two leading experts in this rapidly evolving area of combinatorics, Product Graphs: Structure and Recognition compiles and consolidates a wealth of information previously scattered throughout the literature, providing researchers in the field with ready access to numerous recent results as well as several new recognition algorithms and proofs. The authors explain all topics from the ground up and make the requisite theory and data structures easily accessible for mathematicians and computer scientists alike. Coverage includes The basic algebraic and combinatorial properties ofproduct graph Hypercubes, median graphs, Hamming graphs, triangle--free graphs, and vertex--transitive graphs Colorings, automorphisms, homorphisms, domination, and the capacity of products of graphs Sample applications, including novel applications to chemical graph theory Clear connections to other areas of graph theory Figures, exercises, and hundreds of references Full Product DetailsAuthor: Wilfried Imrich , Sandi KlavarPublisher: John Wiley and Sons Ltd Imprint: John Wiley & Sons Inc Dimensions: Width: 16.80cm , Height: 2.60cm , Length: 24.30cm Weight: 0.718kg ISBN: 9780471370390ISBN 10: 0471370398 Pages: 360 Publication Date: 28 March 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Unknown Availability: In Print ![]() Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock. Table of ContentsBasic Concepts. Hypercubes. Hamming Graphs. Cartesian Products. Strong and Direct Products. Lexicographic Products. Fast Recognition Algorithms. Invariants. Appendices. Bibliography. Indexes.ReviewsBasic properties, invariants, recognition algorithms for graphs which are...products of graphs. (American Mathematical Monthly, November 2000) ..a valuable addition to the library of any student of, or teacher in, graph theory. (Zentralblatt MATH, Vol. 963, 2001/13) this book should be a valuable addition to the library of any student of, or researcher in, graph theory. (Zentralblatt MATH, Vol. 963 No.13, 2001) """Basic properties, invariants, recognition algorithms for graphs which are...products of graphs."" (American Mathematical Monthly, November 2000) ""..a valuable addition to the library of any student of, or teacher in, graph theory."" (Zentralblatt MATH, Vol. 963, 2001/13) ""this book should be a valuable addition to the library of any student of, or researcher in, graph theory."" (Zentralblatt MATH, Vol. 963 No.13, 2001)" Author InformationWILFRIED IMRICH, PhD, is Professor of Applied Mathematics at Montanuniversitat Leoben in Austria. SANDI KLAVZAR, PhD, is Professor of Discrete and Computer Mathematics at the University of Maribor as well as the University of Ljubljana in Slovenia. Tab Content 6Author Website:Countries AvailableAll regions |