On optimizing edge connectivity of product graphs
From MaRDI portal
Recommendations
- On super edge-connectivity of product graphs
- On restricted edge connectivity of strong product graphs.
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- Super restricted edge connected Cartesian product graphs
Cites work
- scientific article; zbMATH DE number 1332751 (Why is no real title available?)
- scientific article; zbMATH DE number 1062587 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 822753 (Why is no real title available?)
- scientific article; zbMATH DE number 2197917 (Why is no real title available?)
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Connectivity and edge-connectivity of strong product graphs
- Connectivity of lexicographic product and direct product of graphs.
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Domination, Fractional Domination, 2-Packing, and Graph Products
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Graph theoretic reliability analysis for the Boolean n cube networks
- Graph theory
- Hamiltonian decomposition of lexicographic product
- Independence numbers of product graphs
- K-restricted edge connectivity for some interconnection networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Minimally restricted edge connected graphs
- On Factorable Extensions and Subgraphs of Prime Graphs
- On a kind of restricted edge connectivity of graphs
- On a product dimension of graphs
- On computing a conditional edge-connectivity of a graph
- On products of graphs and regular groups
- On the chromatic number of the product of graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Reliable circuits using less reliable relays
- Stable networks and product graphs
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- Sufficient conditions for '-optimality in graphs of diameter 2
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Super Line-Connectivity Properties of Circulant Graphs
- Super p-restricted edge connectivity of line graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- Super restricted edge connectivity of regular graphs
- The Automorphism Group of a Product of Graphs
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The chromatic number of the product of two 4-chromatic graphs is 4
- The independence number of the strong product of cycles
Cited in
(9)- Vulnerability of super edge-connected networks
- The Menger number of the strong product of graphs
- On restricted edge connectivity of strong product graphs.
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On restricted edge-connectivity of lexicographic product graphs
- On the edge connectivity of direct products with dense graphs
- Connectivity of Kronecker products by \(K_2\)
- On super edge-connectivity of product graphs
- A characterization of the edge connectivity of direct products of graphs
This page was built for publication: On optimizing edge connectivity of product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626866)
