3 citations · 4 across the 11 of their papers we have counts for
16 papers · 1 filter
Localized Turán-type inequalities for -index
M. Rajesh Kannan, Hitesh Kumar, Shivaramakrishna Pragada
For a connected graph \(G\), let denote the -index of , i.e., the largest eigenvalue of its signless Laplacian matrix. Abreu and Nikiforov (2013) showed that \[ q(G) \…
Bounds and extremal graphs for the energy of complex unit gain graphs
Aniruddha Samanta, M. Rajesh Kannan
A complex unit gain graph (-gain graph), is a graph where the gain function assigns a unit complex number to each orientation of an edge of an…
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…
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…