10 citations · 39 across the 21 of their papers we have counts for
5 papers · 1 filter
On the construction of cospectral nonisomorphic bipartite graphs
M. Rajesh Kannan, Shivaramakrishna Pragada, Hitesh Wankhede
In this article, we construct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices using partitioned tensor product. This extends the cons…
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…
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…
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…
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…