Abstract
Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph G with adjacency matrix AG, the transition matrix of G with respect to AG is defined as HAG(t)=exp(−itAG), t∈R,i=−1. We say that perfect state transfer from vertex u to vertex v occurs in G at time τ if u≠v and the modulus of the (u,v)-entry of HAG(τ) is equal to 1. If the moduli of all diagonal entries of HAG(τ) are equal to 1 for some τ, then G is called periodic with period τ. In this paper we give a few sufficient conditions for NEPS of complete graphs to be periodic or exhibit perfect state transfer.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
