The signless Laplacian state transfer in Q-graph
Combinatorics
2021-08-04 v1
Abstract
The -graph of a graph , denoted by , is the graph derived from by plugging a new vertex to each edge of and adding a new edge between two new vertices which lie on adjacent edges of . In this paper, we consider to study the existence of the signless Laplacian perfect state transfer and signless Laplacian pretty good state transfer in -graphs of graphs. We show that, if all the signless Laplacian eigenvalues of a regular graph are integers, then the -graph of has no signless Laplacian perfect state transfer. We also give a sufficient condition that the -graph of a regular graph has signless Laplacian pretty good state transfer when has signless Laplacian perfect state transfer between two specific vertices.
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