|
Search: id:A064513
|
|
|
| A064513 |
|
Maximal number of nodes in graph of degree <= n and diameter 2 (another version). |
|
+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
|
Sequence in context: A080149 A128513 A048200 this_sequence A058201 A000947 A125245
Adjacent sequences: A064510 A064511 A064512 this_sequence A064514 A064515 A064516
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 07 2001
|
|
EXTENSIONS
|
Same as A058201 except for final term. I do not know which version is correct! - N. J. A. Sloane (njas(AT)research.att.com).
It is known that a(6) >= 32, a(7)=50, a(8) >= 57, etc.
|
|
|
Search completed in 0.002 seconds
|
