A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
From MaRDI portal
Publication:2409788
DOI10.7151/dmgt.1982zbMath1375.05058OpenAlexW2615753822MaRDI QIDQ2409788
Publication date: 13 October 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1982
Related Items (5)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ On two generalized connectivities of graphs ⋮ The minimum size of a graph with given tree connectivity ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- On the difference of two generalized connectivities of a graph
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- Pendant tree-connectivity
- On the \(\ell\)-connectivity of a graph
- On connectivity of the cartesian product of two graphs
- The Steiner tree packing problem in VLSI design
- Packing Steiner trees: A cutting plane algorithm and computational results
- Connectivity of strong products of graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
- Generalized 3-(edge)-connectivity for undirected double-loop networks
- On the generalized (edge-)connectivity of graphs
- The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
- Graphs with Given Group and Given Graph-Theoretical Properties
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Graphs with large generalized 3-connectivity
- The generalized 3-connectivity of Lexicographic product graphs
- Generalized 3-edge-connectivity of Cartesian product graphs
- The generalized 3-connectivity of Cartesian product graphs
- Edge-connectivity of strong products of graphs
This page was built for publication: A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
