A327201 - OEIS

A327201

Irregular triangle read by rows with trailing zeros removed where T(n,k) is the number of unlabeled simple graphs covering n vertices with non-spanning edge-connectivity k.

1, 0, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 2, 3, 7, 5, 4, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,10

COMMENTS

The non-spanning edge-connectivity of a graph is the minimum number of edges that must be removed to obtain a disconnected or empty graph, ignoring isolated vertices.

LINKS

Table of n, a(n) for n=0..18.

Gus Wiseman, Unlabeled graphs covering 5 vertices, organized by non-spanning edge-connectivity.

EXAMPLE

Triangle begins:

{}

0 1

0 0 1 1

1 1 2 2 1

2 3 7 5 4 1 1

CROSSREFS

Row sums are A002494.