1968/01/01 by K. R. Parthasarathy · 2 citations
Mathematics · Computer Science · #Advanced Combinatorial Mathematics #Graph theory and applications #Graph Labeling and Dimension Problems
paper · pdf · doi:10.4153/cjm-1968-005-0
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.