|
|||||
|
|
An extremal problem in subconnectivity |
|
| Authors: | F T Boesch J A M McHugh |
| 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. |
| Keywords: | |