|
Search: id:A054596
|
|
|
| A054596 |
|
Number of labeled minimally 2-edge-connected graphs by nodes. |
|
+0
2
|
|
| 1, 3, 37, 435, 6996, 134428, 3094785, 82061325, 2473950880, 83606473566, 3132506471139, 128918727009163, 5784184164416490, 281105943314654760, 14716271275161095761, 825944690635111256697, 49490362937885427672552
(list; graph; listen)
|
|
|
OFFSET
|
3,2
|
|
|
COMMENT
|
The reference given here also contains the edge breakups foreach node given here.
|
|
REFERENCES
|
Sridar K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Thesis, University of Georgia, 2000. (Under the direction of Prof. Robert W. Robinson, rwr(AT)cs.uga.edu)
Sridar K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph.D. Dissertation, University of Georgia, 2000. (Under the direction of Prof. Robert W. Robinson, rwr(AT)cs.uga.edu)
|
|
CROSSREFS
|
Cf. A054317, A001072, A054595.
Sequence in context: A120076 A119938 A036942 this_sequence A003717 A003716 A051396
Adjacent sequences: A054593 A054594 A054595 this_sequence A054597 A054598 A054599
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
|
|
Search completed in 0.002 seconds
|
