51 citations · 62 across the 12 of their papers we have counts for
12 papers
Sign-balance of excedances over mod-k-alternating permutations and gamma-positivity
Hiranya Kishore Dey, Iswar Mahato
A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer In this paper, we find the sign-b…
Unimodality and peak location of the characteristic polynomials of two distance matrices of trees
Rakesh Jana, Iswar Mahato, Sivaramakrishnan Sivasubramanian
Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient)…
On the maximum -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices
Joyentanuj Das, Iswar Mahato
For a connected graph , let be the adjacency matrix of and be the diagonal matrix of the degrees of the vertices in . The -matrix of is defined as…
A note on the distance and distance signless Laplacian spectral radius of complements of trees
Iswar Mahato, M. Rajesh Kannan
In this article, we show that the generalized tree shift operation increases the distance spectral radius, distance signless Laplacian spectral radius, and the -spectral radiu…
Extremal problems for the eccentricity matrices of complements 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…
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…
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…
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…
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 ,…
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…
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…