Graft transformations characterize the n-vertex trees with a prescribed number of pendant vertices that maximize both the distance signless Laplacian spectral radius and the distance Laplacian spectral radius.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Some graft transformations and their applications on distance (signless) Laplacian spectra of graphs
Graft transformations characterize the n-vertex trees with a prescribed number of pendant vertices that maximize both the distance signless Laplacian spectral radius and the distance Laplacian spectral radius.