Cycles and paths in Jacobson graphs
Commutative Algebra
2014-01-28 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1401.6618,
title = {Cycles and paths in Jacobson graphs},
author = {Ali Azimi and Mohammad Farrokhi Derakhshandeh Ghouchan},
journal= {arXiv preprint arXiv:1401.6618},
year = {2014}
}
Comments
11 pages, 10 figures