6 papers
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…
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…
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…
Frames generated by graphs
Deepshikha
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by grap…