Abstract
Let G be a graph with adjacency matrix (Formula presented.). The transition matrix of G corresponding to (Formula presented.) is denoted as (Formula presented.). If there is some time (Formula presented.) such that (Formula presented.) 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1518-1533 |
| Number of pages | 16 |
| Journal | Linear and Multilinear Algebra |
| Volume | 68 |
| Issue number | 8 |
| DOIs | |
| State | Published - 2 Aug 2020 |
Keywords
- badly decomposed graph
- cube
- NEPS of graphs
- Perfect state transfer
Fingerprint
Dive into the research topics of 'Perfect state transfer in NEPS of some graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver