Abstract. In this paper, the following problem is considered: does there exist a 𝑡-arc-transitive regular covering graph of an 𝑠-arc-transitive graph for positive integers 𝑡 greater than 𝑠? In ...

This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.

All products featured on WIRED are independently selected by our editors. However, we may receive compensation from retailers and/or from purchases of products through these links. Learn more. Graph ...