Abstract
In this paper, we determine the unique graph among complements of unicyclic graphs which maximizes the distance spectral radius. We also characterize the unique graph among complements of unicyclic graphs of diameter three which maximizes the least distance eigenvalues.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have