activity
20152026
most citedPerfect State Transfer on NEPS of the path P3

21 citations · 25 across the 29 of their papers we have counts for

collaborators

34 papers

math.CO2026

A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite gr…

quant-ph2026

Perfect state transfer in Grover walks on normal Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

A Cayley graph over a finite group is said to be normal if its connection set is a union of some conjugacy classes of . This paper investigates…

math.CO2026

Perfect state transfer in Grover walks on dihedral Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya, Xiwang Cao

The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group . The Grover walk is a discrete-time quantum walk widely studied i…

math.CO2026

Laplacian Pair State Transfer on Total Graphs

Akash Kalita, Bikash Bhattacharjya

The total graph of a graph , denoted , is defined as the graph whose vertex set is the union of the vertex set of and the edge set of , such that two vert…

math.CO2025

State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs

Akash Kalita, Bikash Bhattacharjya

The unitary Cayley graph, denoted , is the graph with vertex set such that two distinct vertices and are adjacent if for some with $1 \leq…

math.CO2025

Pretty good state transfer in Grover walks on abelian Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use…

math.CO2025

Perfect state transfer in Grover walks on association schemes and distance-regular graphs

Koushik Bhakta, Bikash Bhattacharjya

This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perf…

math.CO2025

On Hamiltonicity and Perfect Codes in Non-Cyclic Graphs of Finite Groups

Parveen Parveen, Bikash Bhattacharjya

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any , the subgroup \( \langle a, b \rangle \)…

math.CO2025

Pretty good fractional revival on abelian Cayley graphs

Akash Kalita, Bikash Bhattacharjya

Let be a graph with the adjacency matrix . The transition matrix of , denoted , is defined as , where and …

math.CO2025

State transfer in Grover walks on unitary and quadratic unitary Cayley graphs over finite commutative rings

Koushik Bhakta, Bikash Bhattacharjya

This paper focuses on periodicity and perfect state transfer of Grover walks on two well-known families of Cayley graphs, namely, the unitary Cayley graphs and the quadratic unitar…

math.CO2024★ 1 cited

Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs

Koushik Bhakta, Bikash Bhattacharjya

The quadratic unitary Cayley graph has vertex set , where two vertices and are adjacent if and only if $u…

quant-ph2024

Perfect state transfer on Cayley graphs over a non-abelian group of order

Akash Kalita, Bikash Bhattacharjya

The \textit{transition matrix} of a graph with adjacency matrix is defined by , where and . The graph…

math.CO2024

Grover walks on unitary Cayley graphs and integral regular graphs

Koushik Bhakta, Bikash Bhattacharjya

The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices and are adjacent if . In this paper, we study periodicity and perfect…

quant-ph2023

Quantum walks on blow-up graphs

Bikash Bhattacharjya, Hermie Monterde, Hiranmoy Pal

A blow-up of copies of a graph is the graph obtained by replacing every vertex of by an independent set of size , where the copies of vertices…

math.SP2023

On spectra of Hermitian Randić matrix of second kind

A Bharali, B Bhattacharjya, S Borah +1

Let be a mixed graph and . We write , if there is an oriented edge from a vertex to another vertex , and for an un…

math.CO2022

Chromatic Polynomials of Signed Book Graphs

Deepak Sehrawat, Bikash Bhattacharjya

For and , the -cycle book graph consists of copies of the cycle with one common edge. In this paper, we prove that (a) the number of swit…

math.CO2021

HS-integral and Eisenstein integral mixed Cayley graphs over abelian groups

Monu Kadyan, Bikash Bhattacharjya

A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph…

math.CO2021

HS-integral and Eisenstein integral mixed circulant graphs

Monu Kadyan, Bikash Bhattacharjya

A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph…

math.CO2021

RNA Number of Some Parity Signed Generalized Petersen Graphs

Deepak Sehrawat, Bikash Bhattacharjya

A signed graph is said to be parity signed if there exists a bijection such that if and only if and are…

math.CO2021

H-integral and Gaussian integral normal mixed Cayley graphs

Monu Kadyan, Bikash Bhattacharjya

If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjace…

math.CO2021

Integral mixed cayley graph over abelian group

Monu Kadyan, Bikash Bhattacharjya

A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let be an abelian group. The \textit{mixed Cayley graph} i…

math.CO2021

Enumeration of Switching Non-isomorphic Signed Wheels

Deepak Sehrawat, Bikash Bhattacharjya

Two signed graphs are called switching isomorphic to each other if one is isomorphic to a switching of the other. The wheel is the join of the cycle and a vertex. For $…

math.CO2021★ 2 cited

Integral mixed circulant graph

Monu Kadyan, Bikash Bhattacharjya

A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C…

math.CO2021

Switching equivalence of Hermitian adjacency matrices of mixed graphs

Monu Kadyan, Bikash Bhattacharjya

Let and be a subgroup of the complex numbers of unit modulus. Define to be the set of all Hermitian matrices with entr…