2020/11/17 by Hyungkyu Cheon, Cheon, Hyungkyu
Computer Science · #Computational Geometry and Mesh Generation #Advanced Graph Theory Research #Digital Image Processing Techniques
paper · pdf · doi:10.48550/arxiv.2011.08371
In this paper, we prove that the crossing number of circulant graph C(3k+1;\1,k\) on the projective plane is k for k ≥ 3.