An extremal problem in subconnectivity
Document Type
Article
Publication Date
1-1-1987
Abstract
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. Copyright © 1987 Wiley Periodicals, Inc., A Wiley Company
Identifier
0023440129 (Scopus)
Publication Title
Naval Research Logistics Nrl
External Full Text Location
https://doi.org/10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I
e-ISSN
15206750
ISSN
0894069X
First Page
683
Last Page
686
Issue
5
Volume
34
Recommended Citation
Boesch, F. T. and McHugh, J. A.M., "An extremal problem in subconnectivity" (1987). Faculty Publications. 20999.
https://digitalcommons.njit.edu/fac_pubs/20999
COinS
