Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2202.07202

Laplacian state transfer in vertex complemented coronas

Qiang Wang, Xiaogang Liu

Published Feb 15, 2022• 1 citation
arXivHTMLPDF

Abstract

In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in vertex complemented coronas. We prove that there is no Laplacian perfect state transfer in vertex complemented coronas. In contrast, we give a sufficient condition for vertex complemented coronas to have Laplacian pretty good state transfer.

DOI
10.48550/arxiv.2202.07202

Related papers

Laplacian state transfer in edge coronas

Yipeng Li, Xiaogang Liu, Shenggui Zhang

Characterizing which graphs have Laplaican perfect state transfer or Laplacian pretty good state transfer is an interesting and desirable problem. In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in edge coronas. We give sufficient conditions for edge coronas to not have Laplacian perfect state transfer as well as sufficient conditions for edge coronas to have Laplacian perfect state transfer. Additionally, we also give sufficient conditions for edge coronas to have Laplacian pretty good state transfer.

Linear and Multilinear Algebra•Apr 7, 2020•9 citations

Laplacian Pair State Transfer on Edge Coronas

Akash Kalita, Bikash Bhattacharjya

Let $G$ be a graph with edge set $E(G) = \{e_1, \ldots, e_m\}$, and let $\mathcal{H} = (H_1, \ldots, H_m)$ be an $m$-tuple of graphs. The edge corona $G\diamond\mathcal{H}$ is obtained from the disjoint union of $G,H_1,\ldots,H_m$ by joining both end vertices of each edge $e_j$ to every vertex of $H_j$ for $1\leq j\leq m$. In this paper, we investigate Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on edge coronas. We establish necessary and sufficient conditions for the existence of Laplacian perfect pair state transfer. We also derive sufficient conditions for the non-existence of Laplacian perfect pair state transfer. Further, we identify conditions under which the absence of Laplacian perfect pair state transfer guarantees the existence of Laplacian pretty good pair state transfer. Additionally, we develop constructions based on Cartesian product and tensor product to obtain a few more infinite families of edge coronas admitting Laplacian pretty good pair state transfer. Finally, we investigate the existence of Laplacian pretty good pair state transfer on the edge corona of complete graphs.

arXiv:2611.00866•Oct 31, 2026•0 citations

Perfect state transfer in neighborhood coronas

Xing-Kun Song

The neighborhood corona $G \star H$ is the graph obtained by taking one copy $G$ and $|G|$ copies of $H$, and joining each vertex of the $j$th copy of $H$ to all neighbors of $v_{j}$ in $G$. In this paper, we study the state transfer of neighborhood coronas related to the adjacency matrix. Concretely, we provide some necessary conditions under which the neighborhood corona $G \star H$ admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.

arXiv:2204.05034•Apr 11, 2022•0 citations

Pretty good plus state transfer in cycles

Sarojini Mohapatra, Hiranmoy Pal

We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.

math.COCross-listedarXiv:2603.17595•Mar 19, 2026

Constructing graphs having Laplacian pair state transfer by an edge perturbation

Wei Wang, Xiaogang Liu, Jing Wang

In this paper, we give some sufficient conditions for graphs with an edge perturbation between twin vertices to have Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer. By those sufficient conditions, we also construct many new graphs having Laplacian perfect pair state transfer as well as Laplacian pretty good pair state transfer.

arXiv:2202.04957•Feb 10, 2022•0 citations

Laplacian pretty good edge state transfer in paths

Wang, Wei, Xiaogang Liu, Jing Wang

In this paper, we first give a necessary and sufficient condition for a graph to have Laplacian pretty good pair state transfer. As an application of such result, we give a complete characterization of Laplacian pretty good edge state transfer in paths.

arXiv:2209.04630•Sep 10, 2022•1 citation
In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in vertex complemented coronas. We prove that there is no Laplacian perfect state transfer in vertex complemented coronas. In contrast, we give a sufficient condition for vertex complemented coronas to have Laplacian pretty good state transfer.
Characterizing which graphs have Laplaican perfect state transfer or Laplacian pretty good state transfer is an interesting and desirable problem. In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in edge coronas. We give sufficient conditions for edge coronas to not have Laplacian perfect state transfer as well as sufficient conditions for edge coronas to have Laplacian perfect state transfer. Additionally, we also give sufficient conditions for edge coronas to have Laplacian pretty good state transfer.
Let GGG be a graph with edge set E(G)={e1,…,em}E(G) = \{e_1, \ldots, e_m\}E(G)={e1​,…,em​}, and let H=(H1,…,Hm)\mathcal{H} = (H_1, \ldots, H_m)H=(H1​,…,Hm​) be an mmm-tuple of graphs. The edge corona G⋄HG\diamond\mathcal{H}G⋄H is obtained from the disjoint union of G,H1,…,HmG,H_1,\ldots,H_mG,H1​,…,Hm​ by joining both end vertices of each edge eje_jej​ to every vertex of HjH_jHj​ for 1≤j≤m1\leq j\leq m1≤j≤m. In this paper, we investigate Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on edge coronas. We establish necessary and sufficient conditions for the existence of Laplacian perfect pair state transfer. We also derive sufficient conditions for the non-existence of Laplacian perfect pair state transfer. Further, we identify conditions under which the absence of Laplacian perfect pair state transfer guarantees the existence of Laplacian pretty good pair state transfer. Additionally, we develop constructions based on Cartesian product and tensor product to obtain a few more infinite families of edge coronas admitting Laplacian pretty good pair state transfer. Finally, we investigate the existence of Laplacian pretty good pair state transfer on the edge corona of complete graphs.
The neighborhood corona G⋆HG \star HG⋆H is the graph obtained by taking one copy GGG and ∣G∣|G|∣G∣ copies of HHH, and joining each vertex of the jjjth copy of HHH to all neighbors of vjv_{j}vj​ in GGG. In this paper, we study the state transfer of neighborhood coronas related to the adjacency matrix. Concretely, we provide some necessary conditions under which the neighborhood corona G⋆HG \star HG⋆H admits perfect state transfer, and obtain a new family of graphs with pretty good state transfer based on neighborhood coronas.
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.