4.4 Article

Perfect state transfer in NEPS of some graphs

Journal

LINEAR & MULTILINEAR ALGEBRA
Volume 68, Issue 8, Pages 1518-1533

Publisher

TAYLOR & FRANCIS LTD
DOI: 10.1080/03081087.2018.1548555

Keywords

Perfect state transfer; NEPS of graphs; badly decomposed graph; cube

Categories

Funding

  1. National Natural Science Foundation of China (NSFC) [11571135, 11671320, 11601431]
  2. China Postdoctoral Science Foundation [2016M600813]
  3. Natural Science Foundation of Shaanxi Province [2017JQ1019]
  4. Fundamental Research Funds for the Central Universities [3102018ZY038]

Ask authors/readers for more resources

Let G be a graph with adjacency matrix AG. The transition matrix of G corresponding to A(G) is denoted as H-AC (t) :-= exp(-it(AG) (t is an element of R, i = root-1). If there is some time t is an element of Rsuch that H-AG (tau)(u,v) 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available