activity
20172021
collaborators

14 papers

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.CO2021

Bounds for the extremal eigenvalues of gain Laplacian matrices

M. Rajesh Kannan, Navish Kumar, Shivaramakrishna Pragada

A complex unit gain graph (-gain graph), is a graph where the function assigns a unit complex number to each orientation of an edge of , and its inve…

math.CO2021

Gain distance matrices for complex unit gain graphs

Aniruddha Samanta, M. Rajesh Kannan

A complex unit gain graph (-gain graph), is a graph where the function assigns a unit complex number to each orientation of an edge of , and it…

math.CO2021

On the multiplicity of -eigenvalues and the rank of complex unit gain graphs

Aniruddha Samanta, M. Rajesh Kannan

Let be a connected complex unit gain graph (-gain graph) on a simple graph with vertices and maximum vertex degree . The associated adjac…

math.RA2020

Interval hulls of -matrices and almost -matrices

Projesh Nath Choudhury, M. Rajesh Kannan

We establish a characterization of almost -matrices via a sign non-reversal property. In this we are inspired by the analogous results for -matrices. Next, the interval hull…

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 ,…