Handbook of product graphs Richard Hammack, Wilfried Imrich, Sandi Klavžar.
Material type:
- 9781439813041 (hardcover : alk. paper)
- 511.5 HAM/Han 23
- QA166 .I47 2011
Item type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
![]() |
Goa University Library MCA Book Bank | 511.5 HAM/Han (Browse shelf(Opens below)) | Available | 143280 |
Browsing Goa University Library shelves, Shelving location: MCA Book Bank Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.42 AHN/Lea Least squares orthogonal distance fitting of curves and surfaces in space / | 511.5 AKI/Com Combinatorial Geometry and Graph Theory | 511.5 EVE/Gra Graph algorithms | 511.5 HAM/Han Handbook of product graphs | 511.5 PAC/Gra Graph Drawing | 511.6 NAU-SCH Combinatorial scientific computing | 512 AND-PHI Mathematical Techniques |
Extensively revised, reorganized, updated, and expanded ed. of: Product graphs, structure, and recognition / Wilfried Imrich, Sandi Klavžar. 2011.
Includes bibliographical references and indexes.
Graphs -- Automorphisms and invariants -- Hypercubes and isometric subgraphs -- Graph products -- The four standard graph products -- Cartesian product -- Strong product -- Direct product -- Cancellation -- Lexicographic product -- The relation O and partial cubes -- Median graphs -- The canonical isometric embedding -- A dynamic location problem -- Isometries in strong products and product dimensions -- Fixed box theorems -- Graph representation and algorithms -- Recognizing hypercubes and partial cubes -- Chemical graphs and the Wiener index -- Arboricity, squares and triangles -- Recognizing median graphs -- Recognizing partial hamming graphs and quasi-median graphs -- Factoring the Cartesian product -- Recognizing direct, strong and lexicographic products -- Connectivity -- Coloring and Hedetniemi's conjecture -- Independence number and Shannon capacity -- Domination and Vizing's conjecture -- Cycle spaces and bases -- Selected results -- Infinite graphs -- Products of digraphs -- Near products.
There are no comments on this title.