Abstract
Trees are connected graphs without cycles, which are widely used in different fields. One of the hot topics in graph theory is the eigenvalue of graph's adjacency matrix, also known as graph's adjacency spectrum, which is an important research field of graph theory and has a wide range of practical applications. In this paper, we prove that the spectral radius of the adjacency matrix of the complete binary tree is 2√2 when the number of nodes tends to infinity by the eigenvalue of the adjacency matrix of the complete binary tree.
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.
