Akbari, S. and Csíkvári, Péter and Ghafari, A. and Ghezelahmad, S. Khalashi and Nahvi, M. (2017) Graphs with integer matching polynomial zeros. DISCRETE APPLIED MATHEMATICS, 224. pp. 1-8. ISSN 0166-218X
|
Text
integral_matching_polynomial_Vff.pdf Download (291kB) | Preview |
Abstract
In this paper, we study graphs whose matching polynomials 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 K-7 \ (E(C-3) boolean OR E(C-4)) 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. (C) 2017 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Matching polynomial; Matching integral |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 27 Oct 2017 09:38 |
| Last Modified: | 27 Oct 2017 09:38 |
| URI: | http://real.mtak.hu/id/eprint/66300 |
Actions (login required)
 |
Edit Item |
