On the number of \(r\)-matchings in a tree (Q510338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6686277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of \(r\)-matchings in a tree |
scientific article; zbMATH DE number 6686277 |
Statements
On the number of \(r\)-matchings in a tree (English)
0 references
17 February 2017
0 references
Summary: 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 this paper, we study the minimum and maximum number of \(r\)-matchings in a tree with fixed order.
0 references
matching
0 references
independent set
0 references
0.7822682857513428
0 references
0.7813304662704468
0 references
0.7633631229400635
0 references
