OFFSET
0,5
COMMENTS
A graph is point-determining if no two vertices have the same set of neighbors. This kind of graph is also called a mating graph.
LINKS
Ira Gessel and Ji Li, Enumeration of point-determining graphs, arXiv:0705.0042 [math.CO]
Andy Hardt, Pete McNeely, Tung Phan, and Justin M. Troyka, Combinatorial species and graph enumeration, arXiv:1312.0542 [math.CO].
EXAMPLE
Consider n = 3. The triangle graph is point-determining, but it is not bipartite, so it is not counted in a(3). The graph *--*--* is bipartite, but it is not point-determining (the vertices on the two ends have the same neighborhood), so it is also not counted in a(3). The only graph counted in a(3) is the graph *--* *. - Justin M. Troyka, Nov 27 2013
CROSSREFS
Cf. A232699 (labeled point-determining bipartite graphs).
KEYWORD
nonn,more
AUTHOR
Andy Hardt, Oct 20 2012
STATUS
approved