On the Number of $r$-Matchings in a Tree

Electronic Journal Of Combinatorics

Dong Yeap Kang¹ 

关键词: Matching;    Independent set;    Tree;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. This generalizes both matchings and induced matchings as matchings are $1$-matchings and induced matchings are $2$-matchings. In t

【 授权许可】

Others