English

The signless Laplacian state transfer in Q-graph

Combinatorics 2021-08-04 v1

Abstract

The Q\mathcal{Q}-graph of a graph GG, denoted by Q(G)\mathcal{Q}(G), is the graph derived from GG by plugging a new vertex to each edge of GG and adding a new edge between two new vertices which lie on adjacent edges of GG. In this paper, we consider to study the existence of the signless Laplacian perfect state transfer and signless Laplacian pretty good state transfer in Q\mathcal{Q}-graphs of graphs. We show that, if all the signless Laplacian eigenvalues of a regular graph GG are integers, then the Q\mathcal{Q}-graph of GG has no signless Laplacian perfect state transfer. We also give a sufficient condition that the Q\mathcal{Q}-graph of a regular graph has signless Laplacian pretty good state transfer when GG has signless Laplacian perfect state transfer between two specific vertices.

Keywords

Cite

@article{arxiv.2108.01325,
  title  = {The signless Laplacian state transfer in Q-graph},
  author = {Xiao-Qin Zhang and Shu-Yu Cui and Gui-Xian Tian},
  journal= {arXiv preprint arXiv:2108.01325},
  year   = {2021}
}

Comments

17 pages

R2 v1 2026-06-24T04:46:54.391Z