6 citations · 6 across the 10 of their papers we have counts for
14 papers
Energy of signed graphs and the vertex cover number
Aniruddha Samanta, Deepshikha, Kinkar Chandra Das
The energy of a signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix . In this article, we prove that $\mathca…
Spectral properties of distance Laplacian matrices of complex unit gain graphs
Aniruddha Samanta, Deepshikha
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 spectrally optimal duals for r-erasures of frames generated by graphs
Deepshikha, Aniruddha Samanta
In [9], authors studied spectrally optimal dual frames for 1-erasure and 2-erasures of frames generated by graph. In this paper, we study spectrally optimal dual frames for r-erasu…
Improved bound of graph energy in terms of vertex cover number
Aniruddha Samanta
Let be a simple graph with the vertex cover number . The energy of is the sum of the absolute values of all the adjacency eigenvalues of . I…
Unifying adjacency, Laplacian, and signless Laplacian theories
Aniruddha Samanta, Deepshikha, Kinkar Chandra Das
Let be a simple graph with associated diagonal matrix of vertex degrees , adjacency matrix , Laplacian matrix and signless Laplacian matrix . Recently,…
On spectrally optimal duals of frames generated by graphs
Deepshikha, Aniruddha Samanta
Recently, the concept of frames generated by graphs has been introduced in \cite{D}. In this paper, we study spectrally optimal dual frames of frames generated by graphs. We show t…
On walk-regular graphs and optimal duals of frames generated by graphs
Deepshikha, Aniruddha Samanta
Erasures are a common problem that arises while signals or data are being transmitted. A profound challenge in frame theory is to find the optimal dual frames (-frames) to mini…
Bounds and extremal graphs for the energy of complex unit gain graphs
Aniruddha Samanta, M. Rajesh Kannan
A complex unit gain graph (-gain graph), is a graph where the gain function assigns a unit complex number to each orientation of an edge of an…
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…
Bounds for the energy of a complex unit gain graph
Aniruddha Samanta, M. Rajesh Kannan
A -gain graph, , is a graph in which the function assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposi…
On Weaving Generalized Frames and Generalized Riesz Bases
Deepshikha, Aniruddha Samanta
Weaving frames have potential applications in wireless sensor networks that require distributed processing of signal under different frames. In this paper, we study some new proper…
On the spectrum of complex unit gain graph
Aniruddha Samanta, M. Rajesh Kannan
A -gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The…
On the adjacency matrix of a complex unit gain graph
Ranjit Mehatari, M. Rajesh Kannan, Aniruddha Samanta
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of…