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

Authors:
Miranca Fischermann;Lutz Volkmann;Dieter Rautenbach
Affiliations:
Lehrstuhl II für Mathematik, RWTH-Aachen, 52056 Aachen, Germany;Lehrstuhl II für Mathematik, RWTH-Aachen, 52056 Aachen, Germany;Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Lennéstrasse 2, 53113 Bonn, Germany
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 1
Cited 2

On some counting polynomials in chemistry

Discrete Applied Mathematics - Applications of Graphs in Chemistry and Physics

The largest Hosoya index of (n,n+1)-graphs

Computers & Mathematics with Applications
The smallest Merrifield-Simmons index of (n,n+1)-graphs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.