Mathematics – Combinatorics
Scientific paper
2008-06-12
Mathematics
Combinatorics
19 pages, 1 figure. Fixes errors and typos
Scientific paper
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer}from $u$ to $v$ occurs if there is a time $\tau$ such that $|H(\tau)_{u,v}|=1$. If $u\in V(X)$ and there is a time $\sg$ such that $|H(\sg)_{u,u}|=1$, we say $X$ is periodic at $u$ with period $\sg$. We show that if perfect state transfer from $u$ to $v$ occurs at time $\tau$, then $X$ is periodic at both $u$ and $v$ with period $2\tau$. We extend previous work by showing that a regular graph with at least four distinct eigenvalues is periodic with respect to some vertex if and only if its eigenvalues are integers. We show that, for a class of graphs $X$ including all vertex-transitive graphs, if perfect state transfer occurs at time $\tau$, then $H(\tau)$ is a scalar multiple of a permutation matrix of order two with no fixed points. Using certain Hadamard matrices, we construct a new infinite family of graphs on which perfect state transfer occurs.
No associations
LandOfFree
Periodic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Periodic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Periodic Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-690901