On extremal k-outconnected graphs
Copyright policy )On extremal k-outconnected graphs
The author cites two results of \textit{W. Mader} [Arch. Math. 23, 553--560 (1972; Zbl 0228.05119), Math. Nachr. 53, 145--150 (1972; Zbl 0217.02504), and Abh. Math. Semin. Univ. Hamb. 37, 86--97 (1972; Zbl 0215.33803)] and one of \textit{M. Cai} [Discrete Math. 41, 229--234 (1982; Zbl 0522.05040)] for minimally \(k\)-connected graphs. Here he generalizes these results of Mader and Cai, and proves the maximum number of edges in a minimally \(k\)-outconnected graph and derives all the cases when this bound is tight. (The estimations proved are relatively long and complicated).
- Open University of Israel Israel
Connectivity, Extremal problems in graph theory, extremal graphs, Discrete Mathematics and Combinatorics, minimally \(k\)-outconnected graphs, Theoretical Computer Science
Connectivity, Extremal problems in graph theory, extremal graphs, Discrete Mathematics and Combinatorics, minimally \(k\)-outconnected graphs, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!