The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A327069

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A327069

Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and spanning edge-connectivity k.
(history; published version)

#14 by N. J. A. Sloane at Wed May 26 02:14:33 EDT 2021

STATUS

reviewed

approved

#13 by Michel Marcus at Wed May 26 01:09:25 EDT 2021

STATUS

proposed

reviewed

#12 by Robert Price at Tue May 25 20:59:39 EDT 2021

STATUS

editing

proposed

#11 by Robert Price at Tue May 25 20:59:27 EDT 2021

DATA

1, 1, 0, 1, 1, 0, 4, 3, 1, 0, 26, 28, 9, 1, 0, 296, 475, 227, 25, 1, 0, 6064, 14736, 10110, 1782, 75, 1, 0

EXTENSIONS

a(21)-a(27) from Robert Price, May 25 2021

STATUS

approved

editing

#10 by Alois P. Heinz at Wed Sep 11 17:40:20 EDT 2019

STATUS

proposed

approved

#9 by Gus Wiseman at Wed Sep 11 17:22:55 EDT 2019

STATUS

editing

proposed

#8 by Gus Wiseman at Wed Sep 11 16:41:14 EDT 2019

CROSSREFS

Column k = 2 is A327146.

STATUS

approved

editing

#7 by N. J. A. Sloane at Fri Aug 23 14:15:21 EDT 2019

STATUS

proposed

approved

#6 by Gus Wiseman at Fri Aug 23 10:36:42 EDT 2019

STATUS

editing

proposed

#5 by Gus Wiseman at Fri Aug 23 10:23:21 EDT 2019

COMMENTS

The spanning edge-connectivity of a simple labeled graph is the minimum number of edges that must be removed (without removing incident vertices) to obtain a disconnected or empty graph.