Aniruddha Samanta

activity

20182025

collaborators

Showing math.COShow all

9 papers · 1 filter

math.CO2025

Spectral properties of distance Laplacian matrices of complex unit gain graphs

Aniruddha Samanta, Deepshikha

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

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 $τ$ . The energy $E (G)$ of $G$ is the sum of the absolute values of all the adjacency eigenvalues of $G$ . I…

math.CO2024

Unifying adjacency, Laplacian, and signless Laplacian theories

Aniruddha Samanta, Deepshikha, Kinkar Chandra Das

Let $G$ be a simple graph with associated diagonal matrix of vertex degrees $D (G)$ , adjacency matrix $A (G)$ , Laplacian matrix $L (G)$ and signless Laplacian matrix $Q (G)$ . Recently,…

math.CO2024

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 ( $O D$ -frames) to mini…

math.CO2023

Bounds and extremal graphs for the energy of complex unit gain graphs

Aniruddha Samanta, M. Rajesh Kannan

A complex unit gain graph ( $T$ -gain graph), $Φ = (G, φ)$ is a graph where the gain function $φ$ assigns a unit complex number to each orientation of an edge of $G$ an…

math.CO2021

Gain distance matrices for complex unit gain graphs

Aniruddha Samanta, M. Rajesh Kannan

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