Abstract
In this paper, the characteristic polynomial and the spectrum of the terminal distance matrix for some Kragujevac trees is computed. As Application, we obtain an upper bound and a lower bound for the spectral radius of the terminal distance matrix of the Kragujevac trees.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
