ABSTRACT
Let G be a graph with adjacency matrix . The transition matrix of G corresponding to
is denoted as
. If there is some time
such that
has unit modulus, where u and v are distinct vertices in G, then we say that G admits perfect state transfer from u to v. In this paper, we first show that a non-complete extended p-sum (NEPS) with badly decomposed factors has no perfect state transfer. And then, we prove that NEPS of a cube with odd distance has perfect state transfer when the sum of elements in its basis is not zero and that NEPS of a cube with even distance exhibits perfect state transfer if and only if there is a tuple in the basis such that it has exact one coordinate which is valued 1.
Acknowledgments
We greatly appreciate the anonymous referees for their comments and suggestions.
Disclosure statement
No potential conflict of interest was reported by the authors.
Notes
1 Indeed, let for i=1,2,3 be as in the proof of Proposition 2.12. Then by (Equation2
(2)
(2) ), we have
If m=2 and u=1, v=2, then
which has unit modulus at
. Thus,
has perfect state transfer at
. Note that by [Citation5, Corollary 8] we can also get a sufficient condition for
to have perfect state transfer.