On the sum of the largest $ A_{\alpha} $-eigenvalues of graphs
Let $ A(G) $ and $ D(G) $ be the adjacency matrix and the degree diagonal matrix of a graph $ G $, respectively. For any real number $ \alpha \in[0, 1] $, Nikiforov defined the $ A_{\alpha} $-matrix of a graph $ G $ as $ A_{\alpha}(G) = \alpha D(G)+(1-\alpha)A(G) $. Let $ S_k(A_{\alpha}(G)) $ be the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-06-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022825?viewType=HTML |