Graphs With Few Matching Roots |
| |
| Authors: | Ebrahim Ghorbani |
| |
| Institution: | 1. Department of Mathematics, K.N. Toosi University of Technology, P.O. Box 16315-1618, Tehran, Iran
2. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran
|
| |
| Abstract: | We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomials. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
