Enumeration of unlabelled bicolored graphs by degree parities

Journal of Statistical Planning and Inference

Volumn 58, Issue 1, 1997, Pages 193-206

  Tazawa, Shinsei ^a   Shirakura, Teruhiro ^b  

^a KINKI UNIVERSITY   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

Bicolored graph; Bipartite graph; Counting; Enumeration; Generating function

Indexed keywords

EID: 0031092781     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-3758(96)00070-5     Document Type: Article

References (15)

1. Erdös, P. and A. Rényi (1961). On the strength of connectedness of random graphs. Acta Math. Acad. Sci. Hungar. 12, 261-267.
2. Harary, F. and E.M. Palmer (1973). Graphical Enumeration. Academic, New York.
3. Parthasarathy, K.R. (1968). Enumeration of graphs with given partition. Canad. J. Math. 20, 40-47.
4. Read, R.C. (1962). Euler graphs on labelled nodes. Canad. J. Math. 14, 482-486.
5. Read, R.C. and R.W. Robinson (1982). Enumeration of labelled multigraphs by degree parities. Discrete Math. 42, 99-105.
6. Robinson, R.W. (1969). Enumeration of Euler graphs. In: F. Harary, Ed., Proof Techniques in Graph Theory, Academic, New York, 147-153.
7. Shirakura, T. and S. Tazawa (1987). Enumeration and representation of nonisomorphic weighted graphs. Kobe J. Math. 3, 229-235.
8. m factorials when three-factor and higher order intersections are negligible. J. Japan Statist. Soc. 21, 211-219.
9. m factorial designs of resolution v which permit search of one or two unknown extra three-factor interactions. Ann. Inst. Statist. Math. 44, 185-196.
10. Srivastava, J.N. (1975). Designs for searching non-negligible effects. In: J.N. Srivastava, Ed., A Survey of Statistical design and Linear Models, North-Holland, Amsterdam, 507-519.
11. Srivastava, J.N. and S. Ghosh (1980). Enumeration and representation of nonisomorphic bipartite graphs. Ann. Discrete Math. 6, 315-332.
12. Tazawa, S. (1987). Enumeration of graphs with given number of vertices of odd degree. Colloq. Math. Soc. János Bolyai Combinatorics (Eger, Hungary) 52, 515-525.
13. Tazawa, S. (1993). Enumeration of bicolored graphs with unequal bipartite cardinalities. J. Fac. Sci. Technol. Kinki Univ. 29, 13-21.
14. Tazawa, S. and T. Shirakura (1993). Enumeration of labelled graphs in which the number of odd vertices and the size are given. Kobe J. Math. 10, 71-78.
15. Tazawa, S., T. Shirakura and S. Tamura (1991). Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree. Discrete Math. 90, 63-74.