2000 character limit reached
Perfect state transfer in neighborhood coronas
Published 11 Apr 2022 in math.CO | (2204.05034v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.