Graft transformations characterize the minimum and maximum distance signless Laplacian spectral radius among non-starlike and non-caterpillar trees.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
Graft transformations characterize the minimum and maximum distance signless Laplacian spectral radius among non-starlike and non-caterpillar trees.
-
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.