Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776957 | Discrete Mathematics | 2017 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hiranmoy Pal, Bikash Bhattacharjya,