|
Search: id:A085549
|
|
|
| A085549 |
|
Number of isomorphism classes of connected 4-regular multigraphs of order n, loops allowed. |
|
+0
8
|
|
| 1, 2, 4, 10, 28, 97, 359, 1635, 8296, 48432, 316520, 2305104, 18428254, 160384348, 1506613063, 15180782537
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also the number of different potential face pairing graphs for closed 3-manifold triangulations.
|
|
REFERENCES
|
B. A. Burton, Minimal triangulations and normal surfaces, Ph.D. thesis, University of Melbourne, 2003.
B. A. Burton, Minimal triangulations and face pairing graphs, preprint, 2003.
B. A. Burton, Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find, Discrete and Computational Geometry, 38 (2007), 527-571.
B. Martelli and C. Petronio, Three-manifolds having complexity at most 9, Experiment. Math., Vol. 10 (2001), pp. 207-236
|
|
LINKS
|
B. A. Burton, Regina (3-manifold topology software).
B. A. Burton, Face pairing graphs and 3-manifold enumeration
B. Martelli and C. Petronio, Three-manifolds having complexity at most 9, Experiment. Math., Vol. 10 (2001), pp. 207-236
|
|
PROGRAM
|
Can be generated using Regina (see link above), although generation is slow.
|
|
CROSSREFS
|
Cf. A129429, A129417, A005967, A129430, A129432, A129434, A129436, A118560.
Sequence in context: A030277 A091175 A090594 this_sequence A022492 A123429 A006841
Adjacent sequences: A085546 A085547 A085548 this_sequence A085550 A085551 A085552
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Benjamin A. Burton (bab(AT)debian.org), Jul 04 2003
|
|
EXTENSIONS
|
a(12)-a(16) from Brendan McKay (bdm(at)cs.anu.edu.au), Apr 15 2007, computed using software at http://cs.anu.edu.au/~bdm/nauty/
Edited by njas, Oct 01 2007
|
|
|
Search completed in 0.002 seconds
|
