51 citations · 53 across the 10 of their papers we have counts for
10 papers
A Vertex-Localized Positive Square-Energy Strengthening of Turán's Theorem
Abhay Jayarajan, M. Rajesh Kannan, Shivaramakrishna Pragada +1
Let be a graph of order with the adjacency eigenvalues . Let denote the maximum order of a clique containing vertex . We prove the…
Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov
Sebastian M. Cioabă, Abhay Jayarajan, M. Rajesh Kannan +1
The algebraic connectivity of a graph is a well-studied graph invariant that is related to other properties of the graph such as connectivity and expansion. Given and ,…
Spectral Radius, Vertex Deletion, and Chromatic Number of Signed Graphs
Abhay Jayarajan, M. Rajesh Kannan, Priti Prasanna Mondal +1
A signed graph is a graph with edges given signs or defined by the function . The adjacency matrix of is defined as per these signs. The relation betw…
Structural and extremal properties of -Fiedler value
M. Rajesh Kannan, Rahul Roy
The algebraic connectivity , defined as the second smallest eigenvalue of the Laplacian matrix , admits a well-known variational characterization involving the minimiza…
Localization of spectral Turán-type theorems
M. Rajesh Kannan, Hitesh Kumar, Shivaramakrishna Pragada
Let be a graph, and let and be a vertex and an edge of , respectively. Define (resp. ) to be the order of the largest clique in containing (resp…
When Are Standard Graph Products Isomorphic?
Priti Prasanna Mondal, M. Rajesh Kannan, Fouzul Atik
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We pro…
On the -analog of Algebraic Connectivity
M. Rajesh Kannan, Rahul Roy
The algebraic connectivity of a graph, defined as the second smallest eigenvalue of its Laplacian matrix, admits a well-known variational characterization involving the -no…
Constructing cospectral graphs by unfolding non-bipartite graphs
M. Rajesh Kannan, Shivaramakrishna Pragada, Hitesh Wankhede
In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrice…
On the eigenvalue region of permutative doubly stochastic matrices
Amrita Mandal, Bibhas Adhikari, M. Rajesh Kannan
This paper is devoted to the study of eigenvalue region of the doubly stochastic matrices which are also permutative, that is, each row of such a matrix is a permutation of any oth…
Spectra of eccentricity matrices of graphs
Iswar Mahato, R. Gurusamy, M. Rajesh Kannan +1
The eccentricity matrix of a connected graph is obtained from the distance matrix of by retaining the largest distances in each row and each column, and setting the remaini…