Abstract

Let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$, respectively. For any real $\alpha \in [0,1]$, Nikiforov defined the matrix $A_{\alpha}(G)$ as \[ A_{\alpha}(G) = \alpha D(G) + (1-\alpha) A(G). \] In this paper, we generalize some previous results about the $A_{1/2}$-spectral radius of bicyclic graphs with a given degree sequence. Furthermore, we characterize all extremal bicyclic graphs which have the largest $A_{\alpha}$-spectral radius in the set of all bicyclic graphs with prescribed degree sequences.

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

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.