The largest matching roots of unicyclic graphs with a fixed matching number
In this note, we study the largest matching roots of unicyclic graphs with a given number of fixed matching number. We also characterize the extremal graph with respect to the largest matching roots. In addition, we also study this problem on the trees with a given number of fixed matching number.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-01-01
|
| Series: | Cogent Mathematics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/23311835.2017.1280912 |