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.

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 145; no. 3; pp. 483 - 489
Main Authors Fischermann, Miranca, Volkmann, Lutz, Rautenbach, Dieter
Format Journal Article
LanguageEnglish
Published Lausanne Elsevier B.V 30.01.2005
Amsterdam Elsevier
New York, NY
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Hosoya index
Independent set
Matching
Mathematics
Merrifield–Simmons index
Sciences and techniques of general use
Stable set
Theoretical computing
Tree
Matching
Independent set
Tree
Stable set
Merrifield–Simmons index
Hosoya index
Lower bound
Upper bound
Computer theory
Merrifield-Simmons index
Matching task
Combinatorics
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2004.07.001