2 papers
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.CO2020
On the construction of cospectral graphs for the adjacency and normalized Laplacian matrices
M. Rajesh Kannan, Shivaramakrishna Pragada
In [Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387-390, 2010.], Butler constructed a fami…