论文信息 - A note on the number of matchings and independent sets in trees - 字舞流文

A note on the number of matchings and independent sets in trees

We prove best-possible upper and lower bounds on the number of matchings in a tree in terms of the number of independent sets and the number of 2-independent sets.

Dieter Rautenbach | Lutz Volkmann | Miranca Fischermann

[1] R. Merrifield,et al. Topological methods in chemistry , 1989 .

[2] Haruo Hosoya,et al. On some counting polynomials in chemistry , 1988, Discret. Appl. Math..

[3] Harold Ellsworth Tinnappel. On the topological index , 1952 .

[4] I. Gutman,et al. On the theory of the matching polynomial , 1981, J. Graph Theory.

[5] Oswaldo Araujo,et al. Higher-order Fibonacci numbers , 1996 .

[6] H. Hosoya. Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons , 1971 .

[7] E. J. Farrell,et al. An introduction to matching polynomials , 1979, J. Comb. Theory, Ser. B.