ABSTRACT
F irst: Polynomials appear as generating functions of combinatorial graph invariants.
For example, let m (G ,k) be the number of ways in which k independent edges can be selected in the graph G. Then the sequence m (G ,l), m(G,2), m (G ,3 ),... etc., can be presented by means of the power series:
M(G, i ) = 1 + m(G, l)x + m(G, 2)x* + m(G, 3)x* + . . . ,
with X being an anxiliaiy and meaningless variable. The above series is described as the generating fhnction for the numbers m((7, k). It will be seen later that the function Af ((?, x) is in fact a polynomial.
