Generalized 3-edge-connectivity of Cartesian product graphs.
From MaRDI portal
Publication:5249649
DOI10.1007/S10587-015-0162-9zbMATH Open1363.05145OpenAlexW2052184305MaRDI QIDQ5249649FDOQ5249649
Authors: Yuefang Sun
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
Recommendations
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- Sharp upper bounds for generalized edge-connectivity of product graphs
- The generalized 3-connectivity of graph products
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- The generalized 3-connectivity of Cartesian product
Cites Work
- On connectivity of the cartesian product of two graphs
- Graphs with Given Group and Given Graph-Theoretical Properties
- On the generalized (edge-)connectivity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The generalized 3-connectivity of Cartesian product
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
Cited In (19)
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- The minimal size of a graph with given generalized 3-edge-connectivity.
- Generalized 3-(edge)-connectivity for undirected double-loop networks
- The generalized 3-edge-connectivity of lexicographic product graphs
- Generalized Connectivity of Graphs
- The generalized 3-connectivity of graph products
- The minimum size of a graph with given tree connectivity
- Separation of Cartesian products of graphs on several connected components by the removal of edges
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- 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
- Path 3-(edge-)connectivity of lexicographic product graphs
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- On two generalized connectivities of graphs
- The generalized 3-connectivity of Cartesian product
- The generalized 3-connectivity of lexicographic product graphs
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
This page was built for publication: Generalized 3-edge-connectivity of Cartesian product graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249649)