10 citations · 39 across the 21 of their papers we have counts for
4 papers · 1 filter
Minimizers for the energy of eccentricity matrices of trees
Iswar Mahato, M. Rajesh Kannan
The eccentricity matrix of a connected graph , denoted by , is obtained from the distance matrix of by keeping the largest nonzero entries in each row and ea…
Squared distance matrices of trees with matrix weights
Iswar Mahato, M. Rajesh Kannan
Let be a tree on vertices whose edge weights are positive definite matrices of order . The squared distance matrix of , denoted by , is the block ma…
Signed spectral Turań type theorems
M. Rajesh Kannan, Shivaramakrishna Pragada
A signed graph is a graph where the function assigns either or to each edge of the simple graph . The adjacency matrix of , denoted by , is def…
On the eccentricity matrices of trees: Inertia and spectral symmetry
Iswar Mahato, M. Rajesh Kannan
The \textit{eccentricity matrix} of a connected graph is obtained from the distance matrix of by keeping the largest non-zero entries in each row and each…