I. INTRODUCTION Graphical enumeration plays an important role in graph theory. F. Harary, W. Palmer, C. Y. Chao, and J, G. Wells have used the classical enumeration theorem of Polya and the generalization of de-Bruijn...I. INTRODUCTION Graphical enumeration plays an important role in graph theory. F. Harary, W. Palmer, C. Y. Chao, and J, G. Wells have used the classical enumeration theorem of Polya and the generalization of de-Bruijn to solve numerous problems of graphical enumeration. In our country Zhong Ji and Liu Bolian have also ob-展开更多
Prof. Tu Guizhang proposed three unsolved problems on P(?)lya’s Theorem in his book 'Combinatorial Enumerative Methods With the Applications' (Science Press, 1981, p. 206). In this letter we shall answer the ...Prof. Tu Guizhang proposed three unsolved problems on P(?)lya’s Theorem in his book 'Combinatorial Enumerative Methods With the Applications' (Science Press, 1981, p. 206). In this letter we shall answer the second problem and give the corresponding formulas of cyclic and dihedral action groups.展开更多
Let D and R be two finite sets, R^D={f; f: D→R} the set of all functions from D into R, G a permutation group acting on D, H a permutation group acting on R. L. Carlitz defined the strongly equivalent relation of fun...Let D and R be two finite sets, R^D={f; f: D→R} the set of all functions from D into R, G a permutation group acting on D, H a permutation group acting on R. L. Carlitz defined the strongly equivalent relation of functions in R^D as follows: For any f, g∈R^D, f展开更多
文摘I. INTRODUCTION Graphical enumeration plays an important role in graph theory. F. Harary, W. Palmer, C. Y. Chao, and J, G. Wells have used the classical enumeration theorem of Polya and the generalization of de-Bruijn to solve numerous problems of graphical enumeration. In our country Zhong Ji and Liu Bolian have also ob-
文摘Prof. Tu Guizhang proposed three unsolved problems on P(?)lya’s Theorem in his book 'Combinatorial Enumerative Methods With the Applications' (Science Press, 1981, p. 206). In this letter we shall answer the second problem and give the corresponding formulas of cyclic and dihedral action groups.
文摘Let D and R be two finite sets, R^D={f; f: D→R} the set of all functions from D into R, G a permutation group acting on D, H a permutation group acting on R. L. Carlitz defined the strongly equivalent relation of functions in R^D as follows: For any f, g∈R^D, f
