Perfect state transfer in graphs is a concept arising from quantum physics and quantum
computing. Given a graph G with adjacency matrix AG, the transition matrix of G with respect …

The total graph of a graph G, denoted by T (G), is defined to be the graph whose vertices are
the vertices and edges of G, with two vertices of T (G) adjacent if and only if the …

A continuous-time quantum walk on a graph is represented by the complex matrix, where is
the adjacency matrix of and is a non-negative time. If the graph models a network of …

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 pretty …

A blow-up of n copies of a graph G is the graph obtained by replacing every vertex of G by
an independent set of size n, where the copies of two vertices in G are adjacent in the blow …

Let G be a graph with adjacency matrix A. The transition matrix of G is denoted by H (t) and it
is defined by The graph G has perfect state transfer (PST) from a vertex u to another vertex v …

Let G be a graph with adjacency matrix AG. The transition matrix of G corresponding to AG is
denoted as HAG (t):= exp⁡(− it AG)(t∈ R, i=− 1). If there is some time τ∈ R such that HAG …

Let G be a graph with adjacency matrix A. The transition matrix of G relative to A is defined
by HA (t)≔ exp (− it A), t∈ R. We say that the graph G admits perfect state transfer between …

In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian
pretty good state transfer in edge complemented coronas. We give sufficient conditions for …

Perfect state transfer is poly-time arXiv:1606.02264v2 [math.CO] 6 Dec 2021 Page 1 Perfect
state transfer is poly-time Gabriel Coutinho ∗ Dep. Ciência da Computaçao UFMG Belo …