The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
The number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}. If H1≽H2{H}_{1}\succcurlyeq {H}_{2}, and m(H1,i)>m(H2,i)m\left({H}_...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2024-12-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2024-0120 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|