On the maximum and minimum sizes of a graph with given k-connectivity
From MaRDI portal
Publication:2364084
Recommendations
- The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- The minimum size of a graph with given tree connectivity
- Graphs with large generalized (edge-)connectivity
- On the difference of two generalized connectivities of a graph
Cites work
- scientific article; zbMATH DE number 3861202 (Why is no real title available?)
- scientific article; zbMATH DE number 4070940 (Why is no real title available?)
- scientific article; zbMATH DE number 30760 (Why is no real title available?)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- Generalized 3-(edge)-connectivity for undirected double-loop networks
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- Generalized 3-edge-connectivity of Cartesian product graphs.
- Graph theory
- Maximum generalized local connectivities of cubic Cayley graphs on abelian groups
- Note on the generalized connectivity.
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
- On the -connectivity of a graph
- On the difference of two generalized connectivities of a graph
- On the generalized (edge-)connectivity of graphs
- On two generalized connectivities of graphs
- Rainbow trees in graphs and generalized connectivity
- Sharp upper bounds for generalized edge-connectivity of product graphs
- The generalized 3-connectivity of Cartesian product
- The generalized 3-connectivity of lexicographic product graphs
- The generalized 3-connectivity of random graphs
- Tree connectivities of Cayley graphs on abelian groups with small degrees
Cited in
(10)- On the minimum size of graphs with given generalized connectivity
- The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
- Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
- The minimum size of a graph with given tree connectivity
- Separation of Cartesian products of graphs into several connected components by the removal of vertices
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- On maximum Zagreb indices of bipartite graphs with a given connectivity
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- On two generalized connectivities of graphs
- Turán's theorem and k‐connected graphs
This page was built for publication: On the maximum and minimum sizes of a graph with given \(k\)-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364084)
