A graph is k-connected if it has at least k+1 vertices and remains connected after deleting any k−1 vertices. A k-connected graph is said to be minimal if any its subgraph obtained by deleting any edge is not k-connected. W. Mader proved that any minimal k-connected graph with n vertices has at least \( \frac{\left(k-1\right)n+2k}{2k-1} \) vertices of degree k. The main result of the present paper is that any minimal k-connected graph with minimal number of vertices of degree k is isomorphic to a graph G k,T , where T is a tree the maximal vertex degree of which is at most k + 1. The graph G k,T is constructed from k disjoint copies of the tree T in the following way. If a is a vertex of T of degree j and a 1 , . . . , a k are the corresponding vertices of the copies of T, then k + 1 − j new vertices of degree k, which are adjacent to {a 1 , . . . , a k }, are added. Bibliography: 10 titles.
Similar content being viewed by others
References
G. A. Dirac, “Minimally 2-connected graphs,” J. Reine Angew. Math., 268, 204–216 (1967).
M. D. Plummer, “On minimal blocks,” Trans. Amer. Math. Soc., 134, 85–94 (1968).
W. T. Tutte, Connectivity in Graphs, Univ. Toronto Press, Toronto (1966).
W. Mader, “Ecken Vom Gard n in minimalen n-fach zusammenhangenden Graphen,” Arch. Math., 23, 219–224 (1972).
W. Mader, “On vertices of degree n in minimally n-connected graphs and digraphs,” in: Combinatorics, Paul Erd¨os is Eighty, Vol. 2, Budapest (1996), pp. 423–449.
W. Mader, “Zur Struktur minimal n-fach zusammenh¨angender Graphen,” Abh. Math. Sem. Univ. Hamburg, 49, 49–69 (1979).
J. G. Oxley, “On some extremal connectivity results for graphs and matroids,” Discrete Math., 41, 181–198 (1982).
D. V. Karpov and A. V. Pastor, “The structure of a decomposition of a triconnected graph,” Zap. Nauchn. Semin. POMI, 391, 90–148 (2011).
D. V. Karpov, “Cutsets in a k-connected graph,” Zap. Nauchn. Semin. POMI, 340, 33–60 (2006).
D. V. Karpov, “Minimal biconnected graphs,” Zap. Nauchn. Semin. POMI, 417, 106–127 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 427, 2014, pp. 41–65.
Rights and permissions
About this article
Cite this article
Karpov, D.V. Minimal k-Connected Graphs with Minimal Number of Vertices of Degree k . J Math Sci 212, 666–682 (2016). https://doi.org/10.1007/s10958-016-2697-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-016-2697-1