Author:
Khalashi Ghezelahmad Somayeh
Abstract
Abstract
The matching polynomial of a graph has coefficients that give the number of matchings in the graph. In this paper, we determine all connected graphs on eight vertices whose matching polynomials have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We show that there are exactly two matching integral graphs on eight vertices.
Publisher
Springer Science and Business Media LLC
Reference12 articles.
1. Akbari, S., Csikvári, P., Ghafari, A., Khalashi Ghezelahmad, S., Nahvi, M.: Graphs with integer matching polynomial zeros. Discrete Appl. Math. 224, 1–8 (2017)
2. Balińska, K.T., Cvetković, D., Radosavljević, Z., Simić, S.K., Stevanović, D.: A survey on integral graphs. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 13, 42–65 (2002)
3. Farrell, E.J.: An introduction to matching polynomials. J. Comb. Theory B 27, 75–86 (1979)
4. Ghorbani, E.: Graphs with few matching roots. Graphs Comb. 29, 1377–1381 (2013)
5. Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall Inc, London (1993)