The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G. In this paper, among the unicyclic graphs of order n, we p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3589448 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G. In this paper, among the unicyclic graphs of order n, we present the ordering of the unicyclic graphs with matching number 2 according to the λ1G values for n≥11 and also determine the graphs with the first and second largest λ1G values with matching number 3. |
|---|---|
| ISSN: | 2314-4785 |