Graphs with integer matching polynomial zeros

DOI10.1016/J.DAM.2017.02.009MaRDI QIDQ526810zbMATH OpenOpenAlexFDO

Authors Péter Csikvári, A. Ghafari, S. Akbari, S. Khalashi Ghezelahmad, Mina Nahvi

Publication date 15 May 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.00782

zbMATH Keywords

matching integralmatching polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that apart from K7 n (E(C3) [ E(C4)) there is no connected k-regular matching integral graph if k ? 2. It is also shown that if G is a graph with a perfect matching, then its matching polynomial has a zero in the interval (0, 1]. Finally, we describe all claw-free matching integral graphs.

Recommendations

• On matching integral graphs
• scientific article; zbMATH DE number 1896991
• On the location of zeros of the Laplacian matching polynomials of graphs
• scientific article; zbMATH DE number 6310920
• Matching polynomials and duality

Cites work

• 1-Factors and Antifactor Sets
• A note on Hamiltonian circuits
• A survey on integral graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Graph theory
• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3679880 (Why is no real title available?)
• scientific article; zbMATH DE number 3720957 (Why is no real title available?)
• scientific article; zbMATH DE number 3477222 (Why is no real title available?)
• scientific article; zbMATH DE number 3492724 (Why is no real title available?)
• On the theory of the matching polynomial
• Some Theorems on Abstract Graphs
• Theory of Monomer-Dimer Systems. Erratum
• Uniqueness of the matching polynomial

Cited in

(9)

• Lower bounds on matching energy of graphs
• On the location of zeros of the Laplacian matching polynomials of graphs
• On matching integral graphs
• On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs
• Extremal matching energy and the largest matching root of complete multipartite graphs
• scientific article; zbMATH DE number 1512193 (Why is no real title available?)
• Matching Energy of Graphs with Maximum Degree at Most 3
• Matching integral graphs with maximum vertex degree four
• On integral variations for roots of the Laplacian matching polynomial of graphs

This page was built for publication: Graphs with integer matching polynomial zeros

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