Title

On some extremal connectivity results for graphs and matroids

Document Type

Article

Publication Date

1-1-1982

Abstract

Dirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected graph G has at least ((n-1)|V(G)|-2n)/(2n-1) vertices of degree n. This paper determines the graphs which are extremal with respect to these two results and, in addition, establishes a similar extremal result for minimally connected matroids. © 1982.

Publication Source (Journal or Book title)

Discrete Mathematics

First Page

181

Last Page

198

This document is currently not available here.

Share

COinS