On the Generalized Adjacency Spread of a Graph
On the Generalized Adjacency Spread of a Graph
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 …