We prove that the corona product of two graphs has no Laplacian perfect state transfer whenever the first graph has at least two vertices. This complements a result of Coutinho and Liu who showed that no tree of size greater than two has Laplacian perfect state transfer. In contrast, we prove that the corona product of two graphs exhibits Laplacian pretty good state transfer, under some mild conditions. This provides the first known examples of families of graphs with Laplacian pretty good state transfer. Our result extends of the work of Fan and Godsil on double stars to the Laplacian setting. Moreover, we also show that the corona product of any cocktail party graph with a single vertex graph has Laplacian pretty good state transfer, even though odd cocktail party graphs have no perfect state transfer.
We study state transfer in quantum walk on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer.1 maximum degree k which have perfect state transfer. Therefore, the following relaxation of this notion is often more useful to consider. The state transfer between u and v is called "pretty good" (see Godsil [18]) or "almost perfect" (see Vinet and Zhedanov [27]) if the (u, v)-entry of the unitary matrix U(t) can be made arbitrarily close to one.Christandl et al. [9,8] observed that the path P n on n vertices has antipodal perfect state transfer if and only if n = 2, 3. In a striking result, Godsil et al. [21] proved that P n has antipodal pretty good state transfer if and only if n + 1 is a prime, twice a prime, or a power of two. This provides the first family of graphs with pretty good state transfer which correspond to the quantum spin chains originally studied by Bose.Shortly after, Fan and Godsil [12] studied a family of graphs obtained by taking two cones K 1 +K m and then connecting the two conical vertices. They showed that these graphs, which are called double stars, have no perfect state transfer, but have pretty good state transfer between the two conical vertices if and only if 4m + 1 is a perfect square. These graphs provide the second family of graphs known to have pretty good state transfer.In this work, we provide new families of graphs with pretty good state transfer. Our constructions are based on a natural generalization of Fan and Godsil's double stars. The corona product of an n-vertex graph G with another graph H, typically denoted G • H, is obtained by taking n copies of the cone K 1 + H and by connecting the conical vertices according to G. In a corona product G • H, we sometimes call G the base graph and H the pendant graph. This graph product was introduced by Frucht and Harary [15] in their study of automorphism groups of graphs which are obtained by wreath products.We first observe that perfect state transfer on corona products is extremely rare. This is mainly due to the specific forms of the corona eigenvalues (which unsurprisingly resemble the eigenvalues of cones) coupled with the fact that periodicity is a necessary condition for perfect state transfer. Our negative results apply to corona families G • H when H is either the empty or the complete graph, under suitable conditions on G. In a companion work [1], we observed an optimal negative result which holds for all H but in a Laplacian setting.Given that perfect state transfer is rare, our subsequent results mainly focus on pretty good state transfer. We prove that the family of graphs K 2 • K m , which are called barbell graphs (see Ghosh et al. [16]), admit pretty good state transfer for all m. Here, state transfer occurs between the two vertices of K 2 . This is in contrast to the double stars K 2 • K m where pretty good state transfer requires number-theoretic conditions on m.We observe something curious for corona products when the base graph is c...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.