On optimizing edge connectivity of product graphs
From MaRDI portal
Publication:626866
DOI10.1016/j.disc.2010.12.012zbMath1222.05226OpenAlexW2087991374MaRDI QIDQ626866
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.012
Related Items (6)
On the edge connectivity of direct products with dense graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ Vulnerability of super edge-connected networks ⋮ The Menger number of the strong product of graphs ⋮ Connectivity of Kronecker products by \(K_2\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Super \(p\)-restricted edge connectivity of line graphs
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- K-restricted edge connectivity for some interconnection networks
- Minimally restricted edge connected graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- The chromatic number of the product of two 4-chromatic graphs is 4
- On computing a conditional edge-connectivity of a graph
- The independence number of the strong product of cycles
- On a product dimension of graphs
- Hamiltonian decomposition of lexicographic product
- On a kind of restricted edge connectivity of graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Super restricted edge connectivity of regular graphs
- On products of graphs and regular groups
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Super Line-Connectivity Properties of Circulant Graphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Graph theoretic reliability analysis for the Boolean n cube networks
- On the chromatic number of the product of graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Domination, Fractional Domination, 2-Packing, and Graph Products
- On Factorable Extensions and Subgraphs of Prime Graphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- Stable networks and product graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- The Automorphism Group of a Product of Graphs
- Reliable circuits using less reliable relays
- Independence numbers of product graphs
This page was built for publication: On optimizing edge connectivity of product graphs
