论文信息 - LABELLED GRAPHS WITH SMALL VERTEX DEGREES AND P-RECURSIVENESS *

LABELLED GRAPHS WITH SMALL VERTEX DEGREES AND P-RECURSIVENESS *

We show that the number of labelled graphs with vertices of degrees 1, 2, 3 or 4 only satisfy linear recurrence equations, and are therefore P-recursive. We conjecture that the number of labelled graphs with vertices whose degrees belong to a given finite set is also P-recursive. AMS(MOS) subject classifications. 05C30, 05A15

I.. | I. | P. | GOULDENf AND | D. M. JACKSONf | D. Jacksonf | G. And

[1] Ian P. Goulden,et al. THE HAMMOND SERIES OF A SYMMETRIC FUNCTION AND ITS APPLICATION TO P-RECURSIVENESS* , 1983 .

[2] Brendan D. McKay. APPLICATIONS OF A TECHNIQUE FOR LABELLED ENUMERATION , 1983 .

[3] R. C. Read,et al. The Enumeration of Locally Restricted Graphs (I) , 1959 .

[4] Nicholas C. Wormald,et al. Number of labeled 4-regular graphs , 1980, J. Graph Theory.