An edge extremal result for subcohesion

F. T. Boesch; J. A.M. McHugh

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

An edge extremal result for subcohesion

F. T. Boesch, J. A.M. McHugh

Computer Science

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1-7
Number of pages	7
Journal	Journal of Combinatorial Theory, Series B
Volume	38
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(85)90087-5
State	Published - Feb 1985

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(85)90087-5

Cite this

@article{b214eb25c26e404c91412b94b54aedc2,

title = "An edge extremal result for subcohesion",

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.",

author = "Boesch, {F. T.} and McHugh, {J. A.M.}",

note = "Funding Information: under NSF Grant",

year = "1985",

month = feb,

doi = "10.1016/0095-8956(85)90087-5",

language = "English (US)",

volume = "38",

pages = "1--7",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - An edge extremal result for subcohesion

AU - Boesch, F. T.

AU - McHugh, J. A.M.

N1 - Funding Information: under NSF Grant

PY - 1985/2

Y1 - 1985/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46549101632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46549101632&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(85)90087-5

DO - 10.1016/0095-8956(85)90087-5

M3 - Article

AN - SCOPUS:46549101632

SN - 0095-8956

VL - 38

SP - 1

EP - 7

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

An edge extremal result for subcohesion

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this