An extremal problem in subconnectivity

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

doi:10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I

An extremal problem in subconnectivity

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

Computer Science

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

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.

Original language	English (US)
Pages (from-to)	683-686
Number of pages	4
Journal	Naval Research Logistics (NRL)
Volume	34
Issue number	5
DOIs	https://doi.org/10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I
State	Published - Oct 1987

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Ocean Engineering
Management Science and Operations Research

Access to Document

10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I

Cite this

@article{734baee042514c28a54ced87847480cb,

title = "An extremal problem in subconnectivity",

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

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

year = "1987",

month = oct,

doi = "10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I",

language = "English (US)",

volume = "34",

pages = "683--686",

journal = "Naval Research Logistics (NRL)",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "5",

}

TY - JOUR

T1 - An extremal problem in subconnectivity

AU - Boesch, F. T.

AU - McHugh, J. A.M.

PY - 1987/10

Y1 - 1987/10

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

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

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

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

U2 - 10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I

DO - 10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I

M3 - Article

AN - SCOPUS:0023440129

SN - 0894-069X

VL - 34

SP - 683

EP - 686

JO - Naval Research Logistics (NRL)

JF - Naval Research Logistics (NRL)

IS - 5

ER -

An extremal problem in subconnectivity

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this