Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (Q2380236)
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 5686784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover |
scientific article; zbMATH DE number 5686784 |
Statements
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (English)
0 references
26 March 2010
0 references
Summary: We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.
0 references
0.8997731804847717
0 references
0.821566641330719
0 references
0.7782686352729797
0 references
0.7746617794036865
0 references
