Graphs with six distinct matching roots

DOI10.1016/j.ipl.2014.10.012zbMath1309.05103OpenAlexW2008751850MaRDI QIDQ2339593

Hailiang Zhang, Guanglong Yu, Shanlin Li

Publication date: 2 April 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.012

zbMATH Keywords

graph algorithmsmatching polynomialmatching uniquematching equivalent

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Further results on the largest matching root of unicyclic graphs ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs

Cites Work

• Graphs with few matching roots
• Recent results in the theory of graph spectra
• The matching polynomial of a regular graph
• Algebraic matching theory
• Theory of monomer-dimer systems

This page was built for publication: Graphs with six distinct matching roots