Generalized 3-edge-connectivity of Cartesian product graphs
From MaRDI portal
Publication:5249649
DOI10.1007/s10587-015-0162-9zbMath1363.05145OpenAlexW2052184305MaRDI QIDQ5249649
Publication date: 6 May 2015
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/144215
Related Items (8)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ On two generalized connectivities of graphs ⋮ The minimum size of a graph with given tree connectivity ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ On the difference of two generalized connectivities of a graph ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- On connectivity of the cartesian product of two graphs
- On the generalized (edge-)connectivity of graphs
- Graphs with Given Group and Given Graph-Theoretical Properties
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- The generalized 3-connectivity of Cartesian product graphs
This page was built for publication: Generalized 3-edge-connectivity of Cartesian product graphs