Mathematics – Combinatorics
Scientific paper
2010-10-22
Linear Algebra and its Applications, 435(10) 2011, 2468-2474
Mathematics
Combinatorics
10 pages, minor revisions
Scientific paper
10.1016/j.laa.2011.04.022
Suppose $C$ is a subset of non-zero vectors from the vector space $\mathbb{Z}_2^d$. The cubelike graph $X(C)$ has $\mathbb{Z}_2^d$ as its vertex set, and two elements of $\mathbb{Z}_2^d$ are adjacent if their difference is in $C$. If $M$ is the $d\times |C|$ matrix with the elements of $C$ as its columns, we call the row space of $M$ the code of $X$. We use this code to study perfect state transfer on cubelike graphs. Bernasconi et al have shown that perfect state transfer occurs on $X(C)$ at time $\pi/2$ if and only if the sum of the elements of $C$ is not zero. Here we consider what happens when this sum is zero. We prove that if perfect state transfer occurs on a cubelike graph, then it must take place at time $\tau=\pi/2D$, where $D$ is the greatest common divisor of the weights of the code words. We show that perfect state transfer occurs at time $\pi/4$ if and only if D=2 and the code is self-orthogonal.
Cheung Wang-Chi
Godsil Chris
No associations
LandOfFree
Perfect state transfer in cubelike 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 Perfect state transfer in cubelike graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect state transfer in cubelike graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-660304