On connectivity of the cartesian product of two graphs
From MaRDI portal
Publication:1294201
DOI10.1016/S0096-3003(98)10041-3zbMath0927.05048MaRDI QIDQ1294201
Publication date: 5 December 1999
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Related Items (36)
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Fault diameter of Cartesian product graphs ⋮ Restricted connectivity for three families of interconnection networks ⋮ Connectivity of the generalized hierarchical product of graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ Polytopality and Cartesian products of graphs ⋮ Subgraph centrality and walk-regularity ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ Super-connectivity and super-edge-connectivity for some interconnection networks ⋮ On linkedness in the Cartesian product of graphs ⋮ Euler index in uncertain graph ⋮ On super connectivity of Cartesian product graphs ⋮ Connectivity of strong products of graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ On average connectivity of the strong product of graphs ⋮ Super connectivity of balanced hypercubes ⋮ Reliability of interconnection networks modeled by Cartesian product digraphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Some topological properties of folded Petersen graph ⋮ A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ THE CONNECTIVITY OF EXCHANGED HYPERCUBES ⋮ Super connectivity of \(k\)-regular interconnection networks ⋮ Super-connected and super-arc-connected Cartesian product of digraphs ⋮ Super restricted edge connected Cartesian product graphs ⋮ On path-pairability in the Cartesian product of graphs ⋮ Connectivity of Cartesian products of graphs ⋮ On super edge-connectivity of product graphs ⋮ Connectivity of semicartesian products ⋮ The antistrong property for special digraph families ⋮ Super connectivity of Kronecker products of graphs ⋮ Connectivity of Cartesian product of hypergraphs ⋮ Generalized 3-edge-connectivity of Cartesian product graphs ⋮ Highly connected star product graphs ⋮ Connectivity of Cartesian product graphs ⋮ Realizability of fault-tolerant graphs
Cites Work
- Sufficient conditions for maximally connected dense graphs
- The superconnectivity of large digraphs and graphs
- Results on the edge-connectivity of graphs
- Graph theoretic reliability analysis for the Boolean n cube networks
- On super-edge-connected digraphs and bipartite digraphs
- Maximally connected digraphs
- On super i‐connected graphs
- Edge‐connectivity in p‐partite graphs
- The number of spanning trees of the regular networks
This page was built for publication: On connectivity of the cartesian product of two graphs
