A note on the A_-spectral radius of graphs

From MaRDI portal
Publication:1790482

DOI10.1016/J.LAA.2018.08.008zbMATH Open1396.05073arXiv1805.05808OpenAlexW2887052616WikidataQ129415998 ScholiaQ129415998MaRDI QIDQ1790482FDOQ1790482


Authors: Huiqiu Lin, Xing Huang, Jie Xue Edit this on Wikidata


Publication date: 2 October 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let G be a graph with adjacency matrix A(G) and let D(G) be the diagonal matrix of the degrees of G. For any real alphain[0,1], Nikiforov [Merging the A- and Q-spectral theories, Appl. Anal. Discrete Math. 11 (2017) 81--107] defined the matrix Aalpha(G) as Aalpha(G)=alphaD(G)+(1alpha)A(G). Let u and v be two vertices of a connected graph G. Suppose that u and v are connected by a path w0(=v)w1cdotsws1ws(=u) where d(wi)=2 for 1leqileqs1. Let Gp,s,q(u,v) be the graph obtained by attaching the paths Pp to u and Pq to v. Let s=0,1. Nikiforov and Rojo [On the alpha-index of graphs with pendent paths, Linear Algebra Appl. 550 (2018) 87--104] conjectured that hoalpha(Gp,s,q(u,v))<hoalpha(Gp1,s,q+1(u,v)) if pgeqq+2. In this paper, we confirm the conjecture. As applications, firstly, the extremal graph with maximal Aalpha-spectral radius with fixed order and cut vertices is characterized. Secondly, we characterize the extremal tree which attains the maximal Aalpha-spectral radius with fixed order and matching number. These results generalize some known results.


Full work available at URL: https://arxiv.org/abs/1805.05808




Recommendations




Cites Work


Cited In (69)





This page was built for publication: A note on the \(A_{\alpha}\)-spectral radius of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790482)