Skip to main navigation Skip to search Skip to main content

Perfect state transfer in NEPS of some graphs

  • Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

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 languageEnglish
Pages (from-to)1518-1533
Number of pages16
JournalLinear and Multilinear Algebra
Volume68
Issue number8
DOIs
StatePublished - 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