Geodesic
Enumeration of Graphs with given Partition
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 40-47

Voir la notice de l'article provenant de la source Cambridge University Press

In this paper we use a generalized form of Polya's theorem (1) to obtain generating functions for the number of ordinary graphs with given partition and for the number of bicoloured graphs with given bipartition. Both the points and lines of the graphs are taken as unlabelled. These graph enumeration problems were proposed by Harary in his review article (4). Read (7, 8) solved the problem for unlabelled general graphs and labelled ordinary graphs. 
Parthasarathy, K. R. Enumeration of Graphs with given Partition. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 40-47. doi: 10.4153/CJM-1968-005-0
@article{10_4153_CJM_1968_005_0,
     author = {Parthasarathy, K. R.},
     title = {Enumeration of {Graphs} with given {Partition}},
     journal = {Canadian journal of mathematics},
     pages = {40--47},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-005-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-005-0/}
}
TY  - JOUR
AU  - Parthasarathy, K. R.
TI  - Enumeration of Graphs with given Partition
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 40
EP  - 47
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-005-0/
DO  - 10.4153/CJM-1968-005-0
ID  - 10_4153_CJM_1968_005_0
ER  - 
%0 Journal Article
%A Parthasarathy, K. R.
%T Enumeration of Graphs with given Partition
%J Canadian journal of mathematics
%D 1968
%P 40-47
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-005-0/
%R 10.4153/CJM-1968-005-0
%F 10_4153_CJM_1968_005_0

[1] 1. de Bruijn, N. G. Generalization of Polya1 s fundamental theorem in enumerative combinatorial analysis, Indag. Math., 21 (1959), 59–69. Google Scholar

[2] 2. Harary, F., The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc, 78 (1955), 445–463. Google Scholar

[3] 3. Harary, F., On the number of bicoloured graphs, Pacific J. Math., 8 (1958), 743–755. Google Scholar

[4] 4. Harary, F., Unsolved problems in the enumeration of graphs, Publ. Math. Inst. Hung. Acad. Sci., 5 (1960), 63–95. Google Scholar

[5] 5. McMahon, P. A., Combinatory analysis, Vol. I (Cambridge 1915; New York 1960). Google Scholar

[6] 6. Mirsky, L., Inequalities and existence theorems in the theory of matrices, J. Math. Anal, and Appl., 9 (1964), 99–118. Google Scholar

[7] 7. Read, R. C., The enumeration of locally restricted graphs I, J. London Math. Soc, 84 (1959), 417–436. Google Scholar

[8] 8. Read, R. C., The enumeration of locally restricted graphs II, J. London Math. Soc, 85 (1960), 344–351. Google Scholar

[9] 9. Ryser, H. J., Matrices of zeros and ones, Bull. Amer. Math. Soc, 66 (1960), 442–464. Google Scholar

Cité par Sources :