Enumeration of connected graphs with cut vertices

Journal of Statistical Planning and Inference

Volumn 106, Issue 1-2, 2002, Pages 409-418

  Jin, Ying Lie ^a   Tazawa, Shinsei ^b   Shirakura, Teruhiro ^c  

^a NANKAI UNIVERSITY   (China)

^b KINKI UNIVERSITY   (Japan)

^c KOBE UNIVERSITY   (Japan)

Author keywords

Block; Connected graph; Cut vertex; Cycle index of graph; Generating function; Graphical enumeration

Indexed keywords

EID: 1542530042     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(02)00225-2     Document Type: Article

References (17)

1. Ford G.W. Uhlenbeck G.E. 1956 Combinatorial problems in the theory of graphs I, III, and IV, Proc. Natl. Acad. Sci. U.S.A. 42, 122-128, 529-535.
2. Harary F. Palmer E.M. Graphical Enumeration 1973 Academic New York
3. Jin Y. Enumeration of labelled connected graphs and Euler graphs with only one cut vertex Yokohama Math. J. 45 1998 125-134
4. Liu C.L. Introduction to Combinatorial Mathematics 1968 McGraw-Hill New York
5. Norman R.Z. 1954 On the number of linear graphs with given blocks. Dissertation, Univ. of Michigan, Ann Arbor, MI.
6. Riddell R.J. 1951 Contributions to the theory of condensation. Dissertation, Univ. of Michigan, Ann Arbor, MI.
7. Robinson R.W. Enumeration of Non-Separable graphs J. Combin. Theory 9 1970 327-356
8. Shirakura T. Tazawa S. Enumeration and representation of nonisomorphic weighted graphs Kobe J. Math. 3 1987 229-235
9. m factorials when three-factor and higher order intersections are negligible J. Japan Statist. Soc. 21 1991 211-219
10. m factorial designs of resolution v which permit search of one or two unknown extra three-factor intersections Ann. Inst. Statist. Math. 44 1992 185-196
11. Srivastava J.N. Designs for searching non-negligible effects. In: Srivastava J.N. (Ed.), A Survey of Statistical Design and Linear Models 1975 507-519 North-Holland Amsterdam
12. Srivastava J.N. Ghosh S. Enumeration and representation of nonisomorphic bipartite graphs Ann. Discrete Math. 6 1980 315-332
13. Tazawa S. Enumeration of graphs with given number of vertices of odd degree Colloq. Math. Soc. János Bolyai Combin. (Eger, Hungary) 52 1987 515-525
14. Tazawa S. Enumeration of bicolored graphs with unequal bipartite cardinalities J. Fac. Sci. Technol. Kinki Univ. 29 1993 13-21
15. Tazawa S. Shirakura T. Enumeration of labelled graphs in with the number of odd vertices and the size are given Kobe J. Math. 10 1993 71-78
16. Tazawa S. Shirakura T. Enumeration of unlabelled bicolored graphs by degree parities J. Statist. Plann. Inference 58 1996 193-206
17. Tazawa S. Jin Y. Shirakura T. Enumeration of labelled 2-connected Euler graphs J. Combin. Inform. System Sci. 23 1-4 1998 407-414