On the maximum and minimum sizes of a graph with given k-connectivity

DOI10.7151/DMGT.1941zbMATH Open1366.05058OpenAlexW2560040948MaRDI QIDQ2364084FDOQ2364084

Authors: Yanyan Li 

Publication date: 17 July 2017

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1941

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

zbMATH Keywords

connectivity\(k\)-connectivitygeneralized connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Graph theory
• Rainbow trees in graphs and generalized connectivity
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• On the \(\ell\)-connectivity of a graph
• On two generalized connectivities of graphs
• Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
• Maximum generalized local connectivities of cubic Cayley graphs on abelian groups
• Generalized 3-(edge)-connectivity for undirected double-loop networks
• On the generalized (edge-)connectivity of graphs
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on the generalized connectivity.
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• On the difference of two generalized connectivities of a graph
• The generalized 3-connectivity of lexicographic product graphs
• Generalized 3-edge-connectivity of Cartesian product graphs.
• The generalized 3-connectivity of Cartesian product
• The generalized 3-connectivity of random graphs
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• Title not available (Why is that?)

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)