1. Eigenvalue localization and Geršgorin disc-related problems on distance and distance-related matrices of graphs.
- Author
-
Atik, Fouzul and Mondal, Priti Prasanna
- Subjects
LAPLACIAN matrices ,MATHEMATICAL bounds ,EIGENVALUES ,MATRICES (Mathematics) ,GRAPH connectivity ,KRONECKER products - Abstract
The distance, distance signless Laplacian and distance Laplacian matrix of a simple connected graph G , are denoted by D (G) , D Q (G) = D (G) + Tr (G) and D L (G) = Tr (G) − D (G) , respectively, where Tr (G) is the diagonal matrix of vertex transmission. Ger s ̌ gorin discs for any n × n square matrix A = [ a i j ] are the discs { z ∈ ℂ : | z − a i i | ≤ R i (A) } , where R i (A) = ∑ j ≠ i | a i j | , i = 1 , 2 , ... , n. The famous Ger s ̌ gorin disc theorem says that all the eigenvalues of a square matrix lie in the union of the Ger s ̌ gorin discs of that matrix. In this paper, some classes of graphs are studied for which the smallest Ger s ̌ gorin disc contains every distance and distance signless Laplacian eigenvalues except the spectral radius of the corresponding matrix. For all connected graphs, a lower bound and for trees, an upper bound of every distance signless Laplacian eigenvalues except the spectral radius is given in this paper. These bounds are comparatively better than the existing bounds. By applying these bounds, we find some infinite classes of graphs for which the smallest Ger s ̌ gorin disc contains every distance signless Laplacian eigenvalues except the spectral radius of the distance signless Laplacian matrix. For the distance Laplacian eigenvalues, we have given an upper bound and then find a condition for which the smallest Ger s ̌ gorin disc contains every distance Laplacian eigenvalue of the distance Laplacian matrix. These results give partial answers from some questions that are raised in [2]. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF