B. Bhattacharjya

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

Showing 2016Show all

4 papers · 1 filter

math.CO2016

Pretty Good State Transfer on Circulant Graphs

Hiranmoy Pal, Bikash Bhattacharjya

Let $G$ be a graph with adjacency matrix $A$ . The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph $G$ is said to admit p…

math.CO2016

Pretty Good State Transfer on Some NEPS

Hiranmoy Pal, Bikash Bhattacharjya

Let $G$ be a graph with adjacency matrix $A$ . The transition matrix of $G$ relative to $A$ is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that the graph $G$ admits perfec…

math.CO2016

A class of gcd-graphs having Perfect State Transfer

Hiranmoy Pal, Bikash Bhattacharjya

Let $G$ be a graph with adjacency matrix $A$ . The transition matrix corresponding to $G$ is defined by $H (t) := exp (i t A)$ , $t\in\Rl$. The graph $G$ is said to have perf…

math.CO2016

Perfect State Transfer on gcd-graphs

Hiranmoy Pal, Bikash Bhattacharjya

Let $G$ be a graph with adjacency matrix $A$ . The transition matrix of $G$ is denoted by $H (t)$ and it is defined by $H (t) := exp (i t A), t \in R .$ The graph $G$ …