Enumeration of Point-Determining Graphs
Combinatorics
2009-11-10 v2
Abstract
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-determining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases.
Keywords
Cite
@article{arxiv.0705.0042,
title = {Enumeration of Point-Determining Graphs},
author = {Ira Gessel and Ji Li},
journal= {arXiv preprint arXiv:0705.0042},
year = {2009}
}