Name
Abstract | ||
|---|---|---|
We investigate graphs whose matching polynomial has six distinct roots. We show that for those graphs if its order n 6 then they are determined by their matching polynomials. Graphs with eigenvalues, Signless Laplacian eigenvalues have structural properties.There is a close connection between the spectral properties & matching polynomial.We characterize the graphs which only have six distinct matching roots.It has some new information of matching polynomial of graphs. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ipl.2014.10.012 | Information Processing Letters |
Keywords | Field | DocType |
Graph algorithms,Matching polynomial,Matching equivalent,Matching unique | Discrete mathematics,Graph,Combinatorics,Optimal matching,Polynomial,Chordal graph,Bipartite graph,Matching polynomial,Factor-critical graph,3-dimensional matching,Mathematics | Journal |
Volume | Issue | ISSN |
115 | 5 | 0020-0190 |
Citations | PageRank | References |
1 | 0.38 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hailiang Zhang | 1 | 5 | 1.84 |
| Guanglong Yu | 2 | 28 | 11.07 |
| Shanlin Li | 3 | 1 | 0.38 |