An extremal problem in subconnectivity

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

Naval Research Logistics (NRL), 1987, vol. 34, issue 5, 683-686

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.

Date: 1987
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198710)34:53.0.CO;2-I

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:34:y:1987:i:5:p:683-686

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().