|
Search: id:A054760
|
|
|
| A054760 |
|
Table T(n,k) = size of smallest (n,k)-cage, or n-regular graph of girth k, n >= 2, k >= 3, read by antidiagonals. |
|
+0
4
|
|
| 3, 4, 4, 5, 6, 5, 6, 8, 10, 6, 7, 10, 19, 14, 7, 8, 12, 30, 26, 24, 8, 9, 14, 40, 42
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
P. R. Christopher, Degree monotonicity of cages, Graph Theory Notes of New York, 38 (2000), 29-32.
M. Daven and C. A. Rodger, (k,g)-cages are 3-connected, Discr. Math., 199 (1999), 207-215.
P. K. Wong, Cages - a survey, J. Graph Theory 6 (1982), 1-22.
|
|
LINKS
|
Gordon Royle, Cubic Cages
|
|
EXAMPLE
|
Table begins
3 4 5 6 7 8 ...
4 6 10 14 24 ...
5 8 19 26 ?
6 10 30 42 ?
|
|
CROSSREFS
|
Cf. A000066, A006787, A006856, A037233.
Sequence in context: A082090 A133196 A059183 this_sequence A079107 A023963 A121500
Adjacent sequences: A054757 A054758 A054759 this_sequence A054761 A054762 A054763
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
njas, Apr 26 2000
|
|
|
Search completed in 0.002 seconds
|
