Abstract
For a real number α ∈ [0, 1], the Aα-matrix of a graph G is defined as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal degree matrix of G, respectively. The Aα-spectral radius of G, denoted by ρα(G), is the largest eigenvalue of Aα(G). In this paper, the Nordhaus–Gaddum type bounds for the Aα-spectral radius are considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.