activity
20192022
most citedOn the eccentricity matrices of trees: Inertia and spectral symmetry

3 citations · 4 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO20221 cited

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…

math.CO20223 cited

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…

math.CO2021

Eccentricity energy change of complete multipartite graphs due to edge deletion

Iswar Mahato, M. Rajesh Kannan

The eccentricity matrix of a graph is obtained from the distance matrix of by retaining the largest distances in each row and each column, and leaving zero…

math.CO2020

On the -spectra of some join graphs

Mainak Basunia, Iswar Mahato, M. Rajesh Kannan

Let be a simple, connected graph and let be the adjacency matrix of . If is the diagonal matrix of the vertex degrees of , then for every real ,…

math.CO2019

On the spectral radius and the energy of eccentricity matrix of a graph

Iswar Mahato, R. Gurusamy, M. Rajesh Kannan +1

The eccentricity matrix of a graph is obtained from the distance matrix by retaining the eccentricities (the largest distance) in each row and each column. In…

math.CO2019

Spectra of eccentricity matrices of graphs

Iswar Mahato, R. Gurusamy, M. Rajesh Kannan +1

The eccentricity matrix of a connected graph is obtained from the distance matrix of by retaining the largest distances in each row and each column, and setting the remaini…