Abstract
ABSTRACT It is known that the minimum number of distinct eigenvalues c(T) of a symmetric matrix whose graph is a given tree T is at least the diameter d(T) of that tree. However, the disparity c(T) − d(T) can be positive. Using branch duplication and rooted seeds, the notion of the ‘most complex seed’ is introduced, and an explicit upper bound on the disparity is given for any tree of a given diameter.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
