Topics in graph theory. Graphs and their Cartesian product
From MaRDI portal
Publication:5302113
zbMATH Open1156.05001MaRDI QIDQ5302113FDOQ5302113
Authors: Wilfried Imrich, Sandi Klavžar, Douglas F. Rall 
Publication date: 6 January 2009
Recommendations
independencehypercubegraph coloringlist coloringconnectivitydominationCartesian productWiener indexHamming graphcrossing numberrecognition algorithmdistinguishing numberprime factorizationcancelationhamiltonian graph
Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cited In (81)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- Steiner Wiener index of block graphs
- A local prime factor decomposition algorithm
- The \(b\)-chromatic index of a graph
- Title not available (Why is that?)
- Thinness of product graphs
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Strong geodetic cores and Cartesian product graphs
- A survey and classification of Sierpiński-type graphs
- Total domination dot-critical graphs
- Strong triadic closure in cographs and graphs of low maximum degree
- On the stability of the Cartesian product of a neural ring and an arbitrary neural network
- On constructing normal and non-normal Cayley graphs
- A textbook of graph theory
- Algorithm to find a maximum 2-packing set in a cactus
- A note on edge-connectivity of the Cartesian product of graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Digraphs products
- Strong geodetic problem in grid-like architectures
- On the fold thickness of graphs
- Betweenness centrality in Cartesian product of graphs
- Domination in digraphs and their direct and Cartesian products
- Betweenness centrality in Cartesian product of graphs
- Handbook of product graphs
- Maximum induced forests of product graphs
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Products of distance degree regular and distance degree injective graphs
- Shifting paths to avoidable ones
- Lattices from tight frames and vertex transitive graphs
- The general position number of the Cartesian product of two trees
- Intervals and convex sets in strong product of graphs
- On general position sets in Cartesian products
- The general position problem on Kneser graphs and on some graph operations
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- Dependence polynomials of some graph operations
- Domination criticality in product graphs
- The general position number of Cartesian products involving a factor with small diameter
- Sharp upper bounds for generalized edge-connectivity of product graphs
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Connected domination game played on Cartesian products
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Structure of Fibonacci cubes: a survey
- The general position number of integer lattices
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- On the isometric path partition problem
- On Cartesian products having a minimum dominating set that is a box or a stairway
- Semigroups generated by partitions
- On clique convergence of graphs
- On minimum identifying codes in some Cartesian product graphs
- Spectra of graphs resulting from various graph operations and products: a survey
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
- On the treewidth of Hanoi graphs
- On two generalized connectivities of graphs
- Regular embeddings of Cartesian product graphs
- Matching extension in prism graphs
- Partition distance in graphs
- The diameter variability of the Cartesian product of graphs
- Embedding grid graphs on surfaces
- Distance degree graphs in the Cartesian product of graphs
- Coloring Hanoi and Sierpiński graphs
- On color-preserving automorphisms of Cayley graphs of odd square-free order
- General \(d\)-position sets
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Determinants of box products of paths
- On Cartesian product of vertex measurable graphs
- Strong edge coloring of Cayley graphs and some product graphs
- CONFIGURATIONS OF HIGHER ORDERS
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- Title not available (Why is that?)
- Mutual-visibility problems on graphs of diameter two
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Global vertex-edge domination sets in total graph and product graph of path \(P_n\) cycle \(C_n\)
- Restrained geodetic domination in graphs
- Recent developments on the structure of Cartesian products of graphs
- Results on Total Restrained Domination number and subdivision number for certain graphs
- Fibonacci \((p,r)\)-cubes as Cartesian products
- Cartesian product of synchronization transitions and hysteresis
- Extendability and criticality in matching theory
- A lower bound and several exact results on the \(d\)-lucky number
- Monitoring the edges of product networks using distances
This page was built for publication: Topics in graph theory. Graphs and their Cartesian product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302113)
