Abstract

Let G be a graph of order n with adjacency matrix A(G) and let D(G) be the diagonal matrix of the degrees of G. For any real α ∈ [0, 1], write Aα(G) for the matrixAα(G)=αD(G)+(1−α)A(G).This paper shows some extremal results on the spectral radius ρα(G) of Aα(G). We determine the upper bound on ρα(G) if α ∈ (0, 1) and G is a graph with no K2, t (t ≥ 3) minor. We also show that the unique outerplanar graph of order n with maximum ρα(G) is the join of a vertex and a path Pn−1. Moreover, we prove that the unique planar graph of order n with maximum signless Laplacian spectral radius is the join of an edge and a path Pn−2.

Full Text
Paper version not known

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.