Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (Q2380236): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q389466 |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Kok Bin Wong / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0810.4986 / rank | |||
Normal rank | |||
Latest revision as of 06:11, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover |
scientific article |
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
