Laplacian state transfer in Q-graph

Yipeng Li, Xiaogang Liu and Shenggui Zhang

Applied Mathematics and Computation, 2020, vol. 384, issue C

Abstract: The Q-graph of a graph G is defined to be the graph obtained from G by inserting a new vertex into each edge of G, and joining by edges those pairs of new vertices which lie on adjacent edges of G. In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in Q-graphs of r-regular graphs for r ≥ 2. We prove that there is no Laplacian perfect state transfer in the Q-graph of an r-regular graph, if r+1 is a prime number. In contrast, we give sufficient conditions for the Q-graph of an r-regular graph, where r+1 is a prime number, to have Laplacian pretty good state transfer.

Keywords: Laplacian perfect state transfer; Continuous-time quantum walk; Laplacian pretty good state transfer; Q-graph (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320303349
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:384:y:2020:i:c:s0096300320303349

DOI: 10.1016/j.amc.2020.125370

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().