| |
| We determine the unique graphs with minimum distance signless Laplacian spectral radius among bipartite graphs with given matching number, among graphs with given independent number and number of pendent vertices, among graphs with given number of odd vertices. We also determine the unique tree with second minimum distance signless Laplacian spectral radius among trees with all vertices being odd and the unique graph with minimum distance signless Laplacian spectral radius among unicyclic graphs with all vertices being odd. |
|
| Keywords:distance, distance signless Laplacian spectral radius, matching number, independent number, Perron vector, pendent vertices, odd vertices |
|
