Bounds for the Generalized Distance Eigenvalues of a Graph
Bounds for the Generalized Distance Eigenvalues of a Graph
Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian, D Q ( G ) be the distance signless Laplacian, and T r ( G ) be the …