On extremal k-outconnected graphs

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n ≥ 3 k - 2 then m ≤ k (n - k), and for n ≥ 3 k - 1 an equality is possible if, and only if, G is the complete bipartite graph Kk, n - k. Cai proved that if n ≤ 3 k - 2 then m ≤ ⌊ (n + k)2 / 8 ⌋, and listed the cases when this bound is tight. In this paper we prove a more general theorem, which implies similar results for minimally k-outconnected graphs; a graph is called k-outconnected from r if it contains k internally disjoint paths from r to every other node. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Nutov, Z. (2008). On extremal k-outconnected graphs. Discrete Mathematics, 308(12), 2533–2543. https://doi.org/10.1016/j.disc.2007.06.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free