Cycles and paths in Jacobson graphs.

MaRDI QIDQ3134343zbMATH OpenFDO

Authors A. Azimi, M. Farrokhi D. G.

Publication date 9 February 2018

Full work available at URL https://arxiv.org/abs/1401.6618

zbMATH Keywords

Eulerian tourEulerian trailHamiltonian cycleHamiltonian pathJacobson graphpancyclic graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

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.

Recommendations

• Some new results on Jacobson graphs
• Some results on the Jacobson graph of a commutative ring
• scientific article; zbMATH DE number 7004644
• scientific article; zbMATH DE number 3991546
• The nonorientable genus of some Jacobson graphs and classification of the projective ones

Cited in

(3)

• Some results on the Jacobson graph of a commutative ring
• Some new results on Jacobson graphs
• The matrix Jacobson graph of finite commutative rings

This page was built for publication: Cycles and paths in Jacobson graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134343)