An edge extremal result for subcohesion

Document Type

Article

Publication Date

1-1-1985

Abstract

The edge-subconnectivity of a graph is defined to be the largest of all the subgraph edge connectivities. A graph is said to be type (n, l) if no subgraph on l or more points is n-edge connected. A canonical class of (n, l) graphs called star-like-(n, l) graphs are introduced. It is then shown that no (n, l) graph has more edges than these canonical graphs. © 1985.

Identifier

46549101632 (Scopus)

Publication Title

Journal of Combinatorial Theory Series B

External Full Text Location

https://doi.org/10.1016/0095-8956(85)90087-5

e-ISSN

10960902

ISSN

00958956

First Page

1

Last Page

7

Issue

1

Volume

38

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS