Periodic graphs

From MaRDI portal
Publication:625386



Abstract: 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 au such that |H(au)u,v|=1. If uinV(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 au, then X is periodic at both u and v with period 2au. 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 au, then H(au) 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.


Summary: Let \(X\) be a graph on \(n\) vertices 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 \(\sigma\) such that \(|H(\sigma)_{u,u}|= 1\), we say \(X\) is periodic at \(u\) with period \(\sigma\). It is not difficult to show that if the ratio of distinct nonzero eigenvalues of \(X\) is always rational, then \(X\) is periodic. We show that the converse holds, from which it follows that a regular graph is periodic if and only if its eigenvalues are distinct. For a class of graphs \(X\) including all vertex-transitive graphs we prove that, 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.




Cited in
(69)


Describes a project that uses

Uses Software






This page was built for publication: Periodic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625386)