Geodesic
Enumeration of Locally Restricted Digraphs
Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 853-860

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

Among the unsolved problems in graphical enumeration listed in (4) is included the determination of the number of graphs and digraphs with a given partition. Parthasarathy (9) has developed a formulation for counting graphs with a given partition by making a suitable modification of the method given in (2) for the enumeration of graphs. We present here an analogous modification that leads to a formula for the number of digraphs with a given partition. Not surprisingly, the main combinatorial device for this purpose is provided by the classical theorem due to Pólya. 
Harary, Frank; Palmer, Ed. Enumeration of Locally Restricted Digraphs. Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 853-860. doi: 10.4153/CJM-1966-085-5
@article{10_4153_CJM_1966_085_5,
     author = {Harary, Frank and Palmer, Ed},
     title = {Enumeration of {Locally} {Restricted} {Digraphs}},
     journal = {Canadian journal of mathematics},
     pages = {853--860},
     year = {1966},
     volume = {18},
     number = {1},
     doi = {10.4153/CJM-1966-085-5},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-085-5/}
}
TY  - JOUR
AU  - Harary, Frank
AU  - Palmer, Ed
TI  - Enumeration of Locally Restricted Digraphs
JO  - Canadian journal of mathematics
PY  - 1966
SP  - 853
EP  - 860
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-085-5/
DO  - 10.4153/CJM-1966-085-5
ID  - 10_4153_CJM_1966_085_5
ER  - 
%0 Journal Article
%A Harary, Frank
%A Palmer, Ed
%T Enumeration of Locally Restricted Digraphs
%J Canadian journal of mathematics
%D 1966
%P 853-860
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-085-5/
%R 10.4153/CJM-1966-085-5
%F 10_4153_CJM_1966_085_5

[1] 1. de Bruijn, N. G., Generalization of Pólya's fundamental theorem in enumerative combinatorial analysis, Nederl. Akad. Wetensch. Proc. Ser. A, 62 (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 bicolored graphs, Pacific J. Math., 8 (1958), 743–755. Google Scholar

[4] 4. Harary, F., Combinatorial problems in graphical enumeration, chap. 6 in Applied combinatorial mathematics, edited by Beckenbach, E. F. (New York, 1964), pp. 185–217. Google Scholar

[5] 5. Harary, F., A seminar on graph theory (New York, 1967). to appear. Google Scholar

[6] 6. Harary, F., Norman, R., and Cartwright, D., Structural models: An introduction to the theory of directed graphs (New York, 1965). Google Scholar

[7] 7. Harary, F. and Palmer, E., The power group enumeration theorem, J. Combinatorial Theory, 1 (1966), to appear. Google Scholar

[8] 8. Katz, L. and Powell, J. H., The number of locally restricted directed graphs, Proc. Amer. Math. Soc., 5 (1954), 621–626. Google Scholar

[9] 9. Parthasarathy, K. R., Enumeration of ordinary graphs with given partition, Can. J. Math., to appear. Google Scholar

[10] 10. Pólya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen, Acta Math., 68 (1937), 145–254. Google Scholar

[11] 11. Sukhatme, P. V., On bipartitional functions, Phil. Trans. Roy. Soc. London, Ser. A, 237 (1938), 375–409. Google Scholar

Cité par Sources :