Premium
An extremal problem in subconnectivity
Author(s) -
Boesch F. T.,
McHugh J. A. M.
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198710)34:5<683::aid-nav3220340508>3.0.co;2-i
Subject(s) - mathematics , combinatorics , graph , induced subgraph isomorphism problem , extremal graph theory , line graph , discrete mathematics , voltage graph
The connectivity of a subgraph of a graph can exceed the connectivity of the graph. We call the largest of the connectivities of all subgraphs the subconnectivity. We then give the exact solution to the extremal problem of determining the maximum number of lines in a p ‐point graph of subconnectivity two.