Aniruddha Samanta

collaborators

3 papers

math.CO2025

Spectral properties of distance Laplacian matrices of complex unit gain graphs

Aniruddha Samanta, Deepshikha

A complex unit gain graph ( $T$ -gain graph), $I^¦ = (G, I ¨ )$ is a graph where the function $I ¨ $ assigns a unit complex number to each orientation of an edge of $G$ , and…

math.FA2025

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…

math.CO2025

Improved bound of graph energy in terms of vertex cover number

Aniruddha Samanta

Let $G$ be a simple graph with the vertex cover number $I ¨ $ . The energy $E (G)$ of $G$ is the sum of the absolute values of all the adjacency eigenvalues of $G$ .…