A382754 List of unlabeled simple graphs, encoded as integers (see comments).
0, 1, 2, 3, 8, 9, 11, 15, 64, 65, 67, 71, 75, 76, 77, 79, 94, 95, 127, 1024, 1025, 1027, 1031, 1039, 1043, 1044, 1045, 1047, 1052, 1053, 1055, 1078, 1079, 1082, 1083, 1086, 1087, 1150, 1151, 1207, 1208, 1209, 1211, 1215, 1231, 1244, 1245, 1247, 1278, 1279, 1519, 1535, 2047
Offset: 0
Examples
As an irregular triangle, where row n >= 0 contains A000088(n) terms: 0; 1; 2, 3; 8, 9, 11, 15; 64, 65, 67, 71, 75, 76, 77, 79, 94, 95, 127; ... 71 is a term, because it is the code of the claw graph. If the edges are taken to be (0,1), (0,2), and (0,3), an optimal permutation of the vertices of the graph is (3, 2, 1, 0), with the lower triangular part of the corresponding adjacency matrix being [0; 0,0; 1,1,1]. Adding 2^(4*3/2) to the binary number 000111, we obtain that the code of the claw graph is 64+7 = 71.
Links
- Pontus von Brömssen, Table of n, a(n) for n = 0..13598 (for graphs on up to 8 vertices)
Comments