most citedAsymptotic Automorphism Groups of Circulant Graphs and Digraphs

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2025

Laplacian Spectrum of cozero-divisor graphs of commutative polynomial rings

Sarbari Mitra, Soumya Bhoumik

The cozero-divisor graph of a commutative ring , denoted , is the graph whose vertices are the non-zero and non-unit elements of , with two distinct vertices and $…

math.CO2025

On Perrin Cordial Labeling: A New Approach in Graph Labeling Theory

Sarbari Mitra, Soumya Bhoumik

In this paper, we introduce the concept of \emph{Perrin cordial labeling}, a novel vertex labeling scheme inspired by the Perrin number sequence and situated within the broader fra…

math.CO2025

On Laplacian and Signless Laplacian Permanental Polynomials of Some Well-known Graphs

Sarbari Mitra, Soumya Bhoumik

The permanent of an matrix is defined as , where denotes the symmetric group on $\{1,2…

cs.CR2025

CSI-IBBS: Identity-Based Blind Signature using CSIDH

Soumya Bhoumik, Sarbari Mitra, Rohit Raj Sharma +1

Identity-based cryptography (IBC), proposed by Adi Shamir, revolutionized public key authentication by eliminating the need for certificates, enabling a more efficient and scalable…

math.CO2025

A Study of Fibonacci Cordial Labeling in Structured Graph Families

Sarbari Mitra, Soumya Bhoumik

A \emph{Fibonacci cordial labeling} of a graph \( G \) is an injective function \( f: V(G) \rightarrow \{F_0, F_1, \dots, F_n\} \), where \( F_i \) denotes the \( i^{\text{th}} \)…

math.CO2025

Irreversible -Threshold Dynamics on Corona and Base- Corona Product Graphs

Eric J. Moon, Soumya Bhoumik, Paul Flesher

We study the irreversible -threshold process on corona-type graph products, including the corona product, the double corona product, and a generalized base- corona constructi…

math.CO2012★ 1 cited

Asymptotic Automorphism Groups of Circulant Graphs and Digraphs

Soumya Bhoumik, Edward Dobson, Joy Morris

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give so…