Publication:5302113

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

Publication date: 6 January 2009

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

05C90: Applications of graph theory

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

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