|
Search: id:A129586
|
|
|
| A129586 |
|
Unlabeled connected bi-point-determining graphs (see A129583). |
|
+0 5
|
| |
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
The calculation of connected bi-point-determining graphs is carried out by examining the connected components of bi-point-determining graphs. For more details, see reference.
|
|
LINKS
|
I. Gessel and J. 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.
Sequence in context: A058892 A056187 A056790 this_sequence A135744 A020514 A059301
Adjacent sequences: A129583 A129584 A129585 this_sequence A129587 A129588 A129589
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Ji Li (vieplivee(AT)hotmail.com), May 07 2007
|
|
EXTENSIONS
|
151096 and 8264613 from Vladeta Jovovic (vladeta(AT)eunet.rs), May 10 2007
|
|
|
Search completed in 0.002 seconds
|