Cycles and paths in Jacobson graphs
Ali Azimi, Mohammad Farrokhi Derakhshandeh Ghouchan · arXiv (Cornell University) · 2014
All finite Jacobson graphs with a Hamiltonian cycle or path, or Eulerian tour or trail are determined, and it is shown that a finite Jacobson graph is Hamiltonian if and only if it is pancyclic. Also, the length of the longest induced cycles and paths in finite Jacobson graphs are obtained.