scientific article; zbMATH DE number 5485636

Wilfried Imrich, Douglas F. Rall, Sandi Klavžar

Publication date: 6 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

independence hypercube hamiltonian graph Hamming graph graph coloring connectivity crossing number Cartesian product domination Wiener index list coloring recognition algorithm distinguishing number prime factorization cancelation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (74)

On the stability of the Cartesian product of a neural ring and an arbitrary neural network ⋮ Embedding grid graphs on surfaces ⋮ Thinness of product graphs ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Intervals and convex sets in strong product of graphs ⋮ Semigroups generated by partitions ⋮ Results on Total Restrained Domination number and subdivision number for certain graphs ⋮ Distance degree graphs in the Cartesian product of graphs ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ Betweenness centrality in Cartesian product of graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ On constructing normal and non-normal Cayley graphs ⋮ The general position number of integer lattices ⋮ Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ Extendability and criticality in matching theory ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ Betweenness centrality in Cartesian product of graphs ⋮ Vizing's conjecture for graphs with domination number 3 -- a new proof ⋮ Total domination dot-critical graphs ⋮ Shifting paths to avoidable ones ⋮ Domination in digraphs and their direct and Cartesian products ⋮ On the fold thickness of graphs ⋮ Unnamed Item ⋮ Dependence polynomials of some graph operations ⋮ Domination criticality in product graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ CONFIGURATIONS OF HIGHER ORDERS ⋮ On two generalized connectivities of graphs ⋮ Maximum induced forests of product graphs ⋮ Determinants of box products of paths ⋮ Cartesian product of synchronization transitions and hysteresis ⋮ Partition distance in graphs ⋮ On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs ⋮ On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes ⋮ Structure of Fibonacci cubes: a survey ⋮ Fibonacci \((p,r)\)-cubes as Cartesian products ⋮ Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime ⋮ Regular embeddings of Cartesian product graphs ⋮ On Cartesian products having a minimum dominating set that is a box or a stairway ⋮ On clique convergence of graphs ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Matching extension in prism graphs ⋮ Algorithm to find a maximum 2-packing set in a cactus ⋮ A survey and classification of Sierpiński-type graphs ⋮ On color-preserving automorphisms of Cayley graphs of odd square-free order ⋮ THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ A local prime factor decomposition algorithm ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Strong triadic closure in cographs and graphs of low maximum degree ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Strong geodetic problem in grid-like architectures ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Steiner Wiener index of block graphs ⋮ On general position sets in Cartesian products ⋮ On the isometric path partition problem ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ The \(b\)-chromatic index of a graph ⋮ Products of distance degree regular and distance degree injective graphs ⋮ On the treewidth of Hanoi graphs ⋮ Lattices from tight frames and vertex transitive graphs ⋮ Spectra of graphs resulting from various graph operations and products: a survey ⋮ THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES ⋮ Digraphs Products ⋮ Restrained geodetic domination in graphs ⋮ General d-position sets ⋮ On the ensemble of optimal dominating and locating-dominating codes in a graph ⋮ Global Vertex-Edge Domination Sets in Total Graph and Product Graph of Path Pn Cycle Cn ⋮ Connected domination game played on Cartesian products ⋮ Strong edge coloring of Cayley graphs and some product graphs

This page was built for publication: