  In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections
between simple graphs, two-graphs, equiangular lines and strongly regular
graph. It is well known that there is a one-to-one correspondence between
regular two-graphs and equiangular tight frames. This article gives a
generalization of two-graphs for which these connections can be mimicked using
roots of unity beyond $\pm 1$.
