Graphs with six distinct matching roots

DOI10.1016/J.IPL.2014.10.012MaRDI QIDQ2339593zbMATH OpenOpenAlexFDO

Authors 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 equivalentmatching polynomialmatching unique

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)

Recommendations

• Graphs with few matching roots
• Graphs characterized by the roots of matching
• Number of 6-matchings in graphs
• The number of perfect matchings in six types of graphs
• The six bidecomposable graphs
• Uniqueness of graph square roots of girth six
• Graphs whose certain polynomials have few distinct roots
• scientific article; zbMATH DE number 3885947
• scientific article; zbMATH DE number 2094523
• scientific article; zbMATH DE number 6310920

Cites work

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

Cited in

(3)

• Extremal matching energy and the largest matching root of complete multipartite graphs
• scientific article; zbMATH DE number 1279107 (Why is no real title available?)
• Further results on the largest matching root of unicyclic graphs

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

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