Connectivity of Cartesian products of graphs
From MaRDI portal
Publication:998569
DOI10.1016/J.AML.2007.06.010zbMATH Open1152.05340OpenAlexW2058759738MaRDI QIDQ998569FDOQ998569
Authors: Simon Špacapan 
Publication date: 29 January 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.06.010
Recommendations
- Connectivity of Cartesian product graphs
- On the connectivity of Cartesian product of graphs
- On connectivity of the cartesian product of two graphs
- Connectivity of generalized Cartesian product graphs
- Connectivity of Cartesian product of hypergraphs
- A note on the connectivity of the Cartesian product of graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- On linkedness in the Cartesian product of graphs
- Linkedness of Cartesian products of complete graphs
- Connectivity of strong products of graphs
Cites Work
- On connectivity of the cartesian product of two graphs
- Title not available (Why is that?)
- Edge-connectivity of strong products of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Bounds on the average connectivity of a graph
- Decycling Cartesian Products of Two Cycles
- Fault-diameter of Cartesian graph bundles
- On the hamiltonicity of the Cartesian product
- Distinguishing Cartesian powers of graphs
Cited In (59)
- Common graphs with arbitrary connectivity and chromatic number
- On the Laplacian spectrum of \(k\)-symmetric graphs
- The restricted edge-connectivity of Kronecker product graphs
- The antistrong property for special digraph families
- The rainbow connectivity of Cartesian product graphs
- On generalized 3-connectivity of the strong product of graphs
- The Menger number of the Cartesian product of graphs
- Second kind maximum matching graph
- \(Z_3\)-connectivity of wreath product of graphs
- On conditional connectivity of the Cartesian product of cycles
- Linkedness of Cartesian products of complete graphs
- On edge connectivity of direct products of graphs
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- Connectivity and edge-bipancyclicity of Hamming shell
- Relationships between algebraic connectivity and vertex connectivity
- Proof of a conjecture on connectivity of Kronecker product of graphs
- On the super connectivity of Kronecker products of graphs
- Regular connected bipancyclic spanning subgraphs of hypercubes
- A note on the connectivity of the Cartesian product of graphs
- A note on edge-connectivity of the Cartesian product of graphs
- Connectivity of strong products of graphs
- The Hamiltonian property and connectivity of the Cartesian product of infinite graphs
- On the Cayley graph of a commutative ring with respect to its zero-divisors
- Regular connected bipancyclic spanning subgraphs of torus networks
- A note on the connectivity of Kronecker products of graphs
- The generalized hierarchical product of graphs
- Separation of Cartesian products of graphs on several connected components by the removal of edges
- Reliability of interconnection networks modeled by Cartesian product digraphs
- On linkedness in the Cartesian product of graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Separation of Cartesian products of graphs into several connected components by the removal of vertices
- Connectivity of direct products of graphs.
- Connectivity of the generalized hierarchical product of graphs
- The connectivity of generalized graph products
- Connectivity of Cartesian product of hypergraphs
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- On the connectivity of Cartesian product of graphs
- Polytopality and Cartesian products of graphs
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Connectivity and super-connectivity of Cartesian product graphs.
- Decomposition of hypercubes into regular connected bipancyclic subgraphs
- The cartesian product of two graphs is stable
- Monochromatic connectivity and graph products
- Hamilton-connected properties in Cartesian product
- Connectivity of Cartesian product graphs
- Title not available (Why is that?)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- On the scramble number of graphs
- Treewidth of Cartesian products of highly connected graphs
- Connectivity of generalized Cartesian product graphs
- Restricted connectivity for some interconnection networks
- On 3-regular bipancyclic subgraphs of hypercubes
- Connectivity of semicartesian products
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
- Generalized 3-edge-connectivity of Cartesian product graphs.
- A note on the connectivity of direct products of graphs
- Title not available (Why is that?)
- A characterization of the edge connectivity of direct products of graphs
- Proper connection number of graph products
This page was built for publication: Connectivity of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998569)
