An edge extremal result for subcohesion

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

Research output: Contribution to journalArticlepeer-review

4 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 languageEnglish (US)
Pages (from-to)1-7
Number of pages7
JournalJournal of Combinatorial Theory, Series B
Volume38
Issue number1
DOIs
StatePublished - Feb 1985

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'An edge extremal result for subcohesion'. Together they form a unique fingerprint.

Cite this