|
Search: id:A058201
|
|
|
| A058201 |
|
Maximal number of nodes in graph of degree <= n and diameter 2. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
F. Comellas, (Degree,Diameter) Problem for Graphs
World Combinatorics Exchange, Home Page
|
|
EXAMPLE
|
a(3) = 10 is achieved by the Petersen graph.
|
|
CROSSREFS
|
Same as A064513 except for final term. I do not know which version is correct! - N. J. A. Sloane (njas(AT)research.att.com).
Sequence in context: A128513 A048200 A064513 this_sequence A000947 A125245 A096689
Adjacent sequences: A058198 A058199 A058200 this_sequence A058202 A058203 A058204
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 29 2000
|
|
EXTENSIONS
|
It is known that a(6) >= 32, a(7)=50, a(8) >= 57, etc.
|
|
|
Search completed in 0.002 seconds
|
