|
|
A324263
|
|
Number of connected graphs on n unlabeled nodes with exactly two peripheral nodes.
|
|
1
|
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
These are the graphs that only have two nodes whose distance from each other is equal to the diameter. An example of such a graph is the path graph.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|