Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:repository.lsu.edu:mathematics_pubs-2304

On some extremal connectivity results for graphs and matroids

Authors
Publication date
1 January 1982
Publisher
LSU Scholarly Repository
Doi

    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

    Similar works

    Full text

    thumbnail-image

    Louisiana State University

    redirect
    oaioai:repository.lsu.edu:mathema...
    Last time updated on 26/10/2023

    This paper was published in Louisiana State University.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.