|
Search: id:A129584
|
|
|
| A129584 |
|
Number of unlabeled bi-point-determining graphs: graphs in which no two vertices have the same neighborhoods or the same augmented neighborhoods (the augmented neighborhood of a vertex is the neighborhood of the vertex union the vertex itself). |
|
+0
5
|
| |
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
This is the unlabeled case of bi-point-determining graphs, which are basically graphs that are both point-determining (no two vertices have the same neighborhoods) and co-point-determining (graphs whose complements are point-determining)
|
|
REFERENCES
|
I. Gessel and J. Li, On Point-Determining Graphs, arXiv:0705.0042
|
|
LINKS
|
Ira Gessel, Ji Li, On Point-Determining Graphs, arXiv:0705.0042
|
|
CROSSREFS
|
Cf. graphs: labeled A006125, unlabeled A000568; connected graphs: labeled A001187, unlabeled A001349; point-determining graphs: labeled A006024, unlabeled A004110; connected point-determining graphs: labeled A092430, unlabeled A004108; connected co-point-determining graphs: labeled A079306, unlabeled A004108; bi-point-determining graphs: labeled A129583, unlabeled A129584; connected bi-point-determining graphs: labeled A129585, unlabeled A129586; phylogenetic trees: labeled A000311, unlabeled A000669.
Adjacent sequences: A129581 A129582 A129583 this_sequence A129585 A129586 A129587
Sequence in context: A064239 A047898 A098559 this_sequence A052559 A053335 A108733
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Ji Li (vieplivee(AT)hotmail.com), May 07 2007
|
|
|
Search completed in 0.002 seconds
|
