Connectivity of Cartesian products of graphs
From MaRDI portal
Publication:998569
DOI10.1016/j.aml.2007.06.010zbMath1152.05340OpenAlexW2058759738MaRDI QIDQ998569
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
Related Items (40)
A note on the connectivity of direct products of graphs ⋮ The rainbow connectivity of cartesian product graphs ⋮ Relationships between algebraic connectivity and vertex connectivity ⋮ Decomposition of hypercubes into regular connected bipancyclic subgraphs ⋮ Separation of Cartesian products of graphs into several connected components by the removal of vertices ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Connectivity of the generalized hierarchical product of graphs ⋮ Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ Linkedness of Cartesian products of complete graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ Polytopality and Cartesian products of graphs ⋮ On the Laplacian spectrum of \(k\)-symmetric graphs ⋮ Proof of a conjecture on connectivity of Kronecker product of graphs ⋮ The Menger number of the Cartesian product of graphs ⋮ Common graphs with arbitrary connectivity and chromatic number ⋮ Regular connected bipancyclic spanning subgraphs of hypercubes ⋮ On edge connectivity of direct products of graphs ⋮ On linkedness in the Cartesian product of graphs ⋮ On the super connectivity of Kronecker products of graphs ⋮ Second kind maximum matching graph ⋮ Connectivity of strong products of graphs ⋮ Unnamed Item ⋮ Restricted connectivity for some interconnection networks ⋮ On 3-regular bipancyclic subgraphs of hypercubes ⋮ On generalized 3-connectivity of the strong product of graphs ⋮ Connectivity and edge-bipancyclicity of Hamming shell ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Monochromatic connectivity and graph products ⋮ On the Cayley Graph of a Commutative Ring with Respect to its Zero-divisors ⋮ Connectivity of semicartesian products ⋮ The antistrong property for special digraph families ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges ⋮ A note on the connectivity of Kronecker products of graphs ⋮ On the scramble number of graphs ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs ⋮ Connectivity of Cartesian product of hypergraphs ⋮ The generalized hierarchical product of graphs ⋮ Generalized 3-edge-connectivity of Cartesian product graphs
Cites Work
- Unnamed Item
- Fault-diameter of Cartesian graph bundles
- On the hamiltonicity of the Cartesian product
- On connectivity of the cartesian product of two graphs
- Bounds on the average connectivity of a graph
- \(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
- Edge-connectivity of strong products of graphs
- Decycling Cartesian Products of Two Cycles
- Distinguishing Cartesian powers of graphs
This page was built for publication: Connectivity of Cartesian products of graphs
