On the Geršgorin disks of distance matrices of graphs

Main Article Content

Mustapha Aouchiche
https://orcid.org/0000-0002-4090-9847
Bilal A. Rather
https://orcid.org/0000-0003-1381-0291
Issmail El Hallaoui
https://orcid.org/0000-0003-0778-2503

Abstract

For a simple connected graph $G$, let $D(G)$, $Tr(G)$, $D^{L}(G)=Tr(G)-D(G)$, and $D^{Q}(G)=Tr(G)+D(G)$ be the distance matrix, the diagonal matrix of the vertex transmissions, the distance Laplacian matrix, and the distance signless Laplacian matrix of $G$, respectively. Atik and Panigrahi [2] suggested the study of the problem: Whether all eigenvalues, except the spectral radius, of $ D(G) $ and $ D^{Q}(G) $ lie in the smallest Geršgorin disk? In this paper, we provide a negative answer by constructing an infinite family of counterexamples.

Article Details

Section
Article