M. Rajesh Kannan

According to our database, M. Rajesh Kannan authored at least 8 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2024

Constructing cospectral graphs by unfolding non-bipartite graphs.

M. Rajesh Kannan, Pragada Shivaramakrishna, Hitesh Wankhede

Discret. Appl. Math., 2024

2023

Squared distance matrices of trees with matrix weights.

Iswar Mahato, M. Rajesh Kannan

AKCE Int. J. Graphs Comb., May, 2023

2022

Gain distance matrices for complex unit gain graphs.

Aniruddha Samanta, M. Rajesh Kannan

Discret. Math., 2022

On the eccentricity matrices of trees: Inertia and spectral symmetry.

Iswar Mahato, M. Rajesh Kannan

Discret. Math., 2022

On the construction of cospectral nonisomorphic bipartite graphs.

M. Rajesh Kannan, Pragada Shivaramakrishna, Hitesh Wankhede

Discret. Math., 2022

2020

Spectra of eccentricity matrices of graphs.

Iswar Mahato, R. Gurusamy, M. Rajesh Kannan, S. Arockiaraj

Discret. Appl. Math., 2020

Interval hulls of N-matrices and almost P-matrices.

Projesh Nath Choudhury, M. Rajesh Kannan

CoRR, 2020

Sign non-reversal property for totally positive matrices and testing total positivity on their interval hull.

Projesh Nath Choudhury, M. Rajesh Kannan

CoRR, 2020