Contents

Ars Combinatoria

  • Research article

Cycles and Paths in Jacobson Graphs

A. Azimi1, M. Farrokhi D. G.2
1Department of Pure Mathematics, Ferpowsi University of Mashhad, Mash-Had, Iran.
2Department of Pure Mathematics, Ferdowsi University of Mashhad, Mash-Had, Iran.
  • Published: 31/07/2017

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.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
A. Azimi, M. Farrokhi D. G.. Cycles and Paths in Jacobson Graphs[J], Ars Combinatoria, Volume 134. 61-74. .