|
Search: id:A006787
|
|
|
| A006787 |
|
Number of n-node graphs with no cycles of length less than 5.
(Formerly M0792)
|
|
+0
6
|
|
| 1, 2, 3, 6, 11, 23, 48, 114, 293, 869, 2963, 12066, 58933, 347498, 2455693, 20592932, 202724920, 2322206466, 30743624324
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Includes graphs with no cycles at all as well as graphs with girth greater than 5.
|
|
REFERENCES
|
B. D. McKay, personal communication.
|
|
LINKS
|
Brendan D. McKay, Isomorph-free exhaustive generation, Table 2.
Brendan D. McKay, Isomorph-Free Exhaustive Generation, J. Algorithms, vol. 26 iss. 2 (1998), 306-324.
|
|
CROSSREFS
|
Cf. A054760, A000066.
Sequence in context: A130131 A123465 A000055 this_sequence A000992 A036648 A047750
Adjacent sequences: A006784 A006785 A006786 this_sequence A006788 A006789 A006790
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Definition corrected by B. D. McKay, Apr 27 2007
a(18)-a(19) (from the McKay reference) added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 17 2008
|
|
|
Search completed in 0.002 seconds
|
