

A287694


Number of notnecessarily connected simple chordless graphs on n vertices.


1




OFFSET

1,2


LINKS



EXAMPLE

1 node: K_1 (1 graph)
2 nodes: \bar K_2, P_2 = K_2 (2 graphs)
3 nodes: \bar K_3, K_1\cup K_2, P_3, C_3 = K_3 (4 graphs)
Here, \bar denotes graph complementation and \cup graph unioning.


CROSSREFS



KEYWORD

nonn,more


AUTHOR



STATUS

approved



