|
Search: id:A054597
|
|
|
| A054597 |
|
Number of labeled 2-connected 3-edge-connected graphs by nodes. |
|
+0
2
|
|
| 1, 26, 1858, 236856, 53448752, 21492710960, 15580155490586, 20666523608722248, 50987290998908713436, 237747545131143536698656, 2125708373867783657045636502, 36886187089139407854559886683336
(list; graph; listen)
|
|
|
OFFSET
|
4,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 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 Robert W. Robinson, rwr(AT)cs.uga.edu)
|
|
CROSSREFS
|
Cf. A054316, A054853.
Cf. A005643.
Sequence in context: A080163 A005644 A123537 this_sequence A005643 A054853 A103642
Adjacent sequences: A054594 A054595 A054596 this_sequence A054598 A054599 A054600
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
|
|
Search completed in 0.002 seconds
|
