OFFSET
0,7
COMMENTS
A graph with one vertex and no edges is considered to be connected. Except for complete graphs, this is the same as vertex-connectivity (A259862).
There are two ways to define (vertex) connectivity: the minimum size of a vertex cut, and the minimum of the maximum number of internally disjoint paths between two distinct vertices. For non-complete graphs they coincide, which is tremendously useful. For complete graphs with at least 2 vertices, there are no cuts but the second method still works so it is customary to use it to justify the connectivity of K_n being n-1. - Brendan McKay, Aug 28 2019.
LINKS
Brendan McKay, confusion over k-connected graphs, posting to Sequence Fans Mailing List, Jul 08 2015.
EXAMPLE
Triangle begins:
1
0 1
1 0 1
2 1 0 1
5 3 2 0 1
13 11 7 2 0 1
CROSSREFS
KEYWORD
AUTHOR
Gus Wiseman, Aug 25 2019
STATUS
approved