On the Generalized Adjacency Spread of a Graph
Open Access
- 15 March 2023
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1416
Abstract
For a simple finite graph G, the generalized adjacency matrix is defined as , where and are respectively the adjacency matrix and diagonal matrix of the vertex degrees. The -spread of a graph G is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the . In this paper, we answer the question posed in (Lin, Z.; Miao, L.; Guo, S. Bounds on the -spread of a graph. Electron. J. Linear Algebra 2020, 36, 214–227). Furthermore, we show that the path graph, , has the smallest among all trees of order n. We establish a relationship between and We obtain several bounds for .
Keywords
This publication has 29 references indexed in Scilit:
- Eigenvalue localization for complex matricesThe Electronic Journal of Linear Algebra, 2014
- Bounds on the -spread of a graphLinear Algebra and its Applications, 2010
- The signless Laplacian spreadLinear Algebra and its Applications, 2010
- On the spread of the spectrum of a graphDiscrete Mathematics, 2009
- Extremal Eigenvalues of Real Symmetric Matrices with Entries in an IntervalSIAM Journal on Matrix Analysis and Applications, 2005
- The spread of the spectrum of a graphLinear Algebra and its Applications, 2001
- Commutativity and spectra of Hermitian matricesLinear Algebra and its Applications, 1994
- Bounds for the spectrum of normal matricesLinear Algebra and its Applications, 1994
- The areal spread of matricesLinear Algebra and its Applications, 1969
- The spread of a matrixMathematika, 1956