Affiliation:
1. Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran 16785-163, Iran
2. Department of Mathematics, University of Kashmir, Srinagar 192101, India
Abstract
For a simple finite graph G, the generalized adjacency matrix is defined as Aα(G)=αD(G)+(1−α)A(G),α∈[0,1], where A(G) and D(G) are respectively the adjacency matrix and diagonal matrix of the vertex degrees. The Aα-spread of a graph G is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the Aα(G). In this paper, we answer the question posed in (Lin, Z.; Miao, L.; Guo, S. Bounds on the Aα-spread of a graph. Electron. J. Linear Algebra 2020, 36, 214–227). Furthermore, we show that the path graph, Pn, has the smallest S(Aα) among all trees of order n. We establish a relationship between S(Aα) and S(A). We obtain several bounds for S(Aα).
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference30 articles.
1. Merging the A- and Q-spectral theories;Nikiforov;Appl. Anal. Discrete Math.,2017
2. On the α-spectral radius of graphs;Guo;Appl. Anal. Discrete Math.,2020
3. The Aα-spectrum of graph product;Li;Electron. J. Linear Algebra,2019
4. Bounds on the Aα-spread of a graph;Lin;Electron. J. Linear Algebra,2020
5. On the least eigenvalue of Aα-matrix of graphs;Liu;Linear Algebra Appl.,2020