Abstract
Let G be a graph with adjacency matrix A. The transition matrix of G relative to A is defined by HA(t)≔exp(−itA),t∈R. We say that the graph G admits perfect state transfer between the vertices u and v at τ∈R if the uvth entry of HA(τ) has unit modulus. Perfect state transfer is a rare phenomenon so we consider an approximation called pretty good state transfer. We find that NEPS (Non-complete Extended P-Sum) of the path on three vertices with basis containing tuples with hamming weights of both parities does not exhibit perfect state transfer. But these NEPS admit pretty good state transfer with an additional condition. Further we investigate pretty good state transfer on Cartesian product of graphs and we find that a graph can have PGST from a vertex u to two different vertices v and w.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.