On the sum of the largest A_{\alpha}-eigenvalues of graphs

arXiv2012.11177MaRDI QIDQ6356583FDOQ6356583

Authors: Zhen Lin, Lianying Miao, Shu-Guang Guo 

Publication date: 21 December 2020

Abstract: For every real $0leqalphaleq1$, Nikiforov defined the $A_{alpha}$-matrix of a graph $G$ as $A_{alpha}(G)=alphaD(G)+(1-alpha)A(G)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the degree diagonal matrix of a graph $G$, respectively. The eigenvalues of $A_{alpha}(G)$ are called the $A_{alpha}$-eigenvalues of $G$. Let $S_k(A_{alpha}(G))$ be the sum of $k$ largest $A_{alpha}$-eigenvalues of $G$. In this paper, we present several upper and lower bounds on $S_k(A_{alpha}(G))$ and characterize the extremal graphs for certain cases, which can be regard as a common generalization of the sum of $k$ largest eigenvalues of adjacency matrix and signless Laplacian matrix of graphs. In addition, some graph operations on $S_k(A_{alpha}(G))$ are presented.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: On the sum of the largest $A_{\alpha}$-eigenvalues of graphs

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