Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
From MaRDI portal
Publication:2380236
zbMath1230.05168arXiv0810.4986MaRDI QIDQ2380236
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.4986
05C05: Trees
05C31: Graph polynomials
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Generalizing Tutte's theorem and maximal non-matchable graphs, Extensions of barrier sets to nonzero roots of the matching polynomial, Generalized \(D\)-graphs for nonzero roots of the matching polynomial, On the largest matching roots of graphs with cut edges, Gallai-Edmonds structure theorem for weighted matching polynomial