Abstract
This work presents a study about the distance matrix of a family of trees called caterpillar graphs. Our purpose is to determine the multiplicity of −2 as distance eigenvalue and the number of distinct distance eigenvalues of a caterpillar graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
