Hamming dimension of a graph-The case of Sierpiński graphs
European Journal of Combinatorics
A tight axiomatization of the median procedure on median graphs
Discrete Applied Mathematics
Mixed fault diameter of Cartesian graph bundles
Discrete Applied Mathematics
Alliance free sets in Cartesian product graphs
Discrete Applied Mathematics
Note: Connectivity of Kronecker products with complete multipartite graphs
Discrete Applied Mathematics
Rainbow domination in the lexicographic product of graphs
Discrete Applied Mathematics
Note: Hamiltonicity of large generalized de Bruijn cycles
Discrete Applied Mathematics
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Discrete Applied Mathematics
Tetravalent arc-transitive locally-Klein graphs with long consistent cycles
European Journal of Combinatorics
Wiener index in weighted graphs via unification of Θ*-classes
European Journal of Combinatorics
Recognizing some complementary products
Theoretical Computer Science
Dense bipartite circulants and their routing via rectangular twisted torus
Discrete Applied Mathematics
Note: Computing distance moments on graphs with transitive Djoković-Winkler relation
Discrete Applied Mathematics
Improved bounds on the difference between the Szeged index and the Wiener index of graphs
European Journal of Combinatorics
Hi-index | 0.01 |
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 Hedetniemis conjecture Results on the independence number of Cartesian powers of vertex-transitive graphs Verification of Vizings 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 books website, which can be reached via the authors home pages.