Enumeration of minimum path covers of trees

DOI10.46787/PUMP.V8I.4108MaRDI QIDQ6859199zbMATH OpenFDO

Authors C. Richard jun. Johnson, Merielyn Sher

Publication date 12 February 2026

Published in PUMP Journal of Undergraduate Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.46787/PUMP.V8I.4108

zbMATH Keywords

maximum multiplicityminimum path coverreal symmetric matricestrees

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• Eigenvalues, multiplicities and graphs
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Smith normal form and acyclic matrices
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The trees for which maximum multiplicity implies the simplicity of other eigenvalues

This page was built for publication: Enumeration of minimum path covers of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859199)