Jacobson图中的圈和路
Cycles and paths in Jacobson graphs
摘要:
确定了所有具有哈密顿圈或路、欧拉圈或迹的有限Jacobson图,并证明了有限Jacobson图是哈密尔顿图当且仅当它是泛圈图.此外,还得到了有限Jacobson图的最长诱导圈和最长诱导路的长度。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。