A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs C n(R) w.r.t. m = 2
math.CO
Submitted: 2026-05-12
Updated: 2026-10-27
Comments: Slightly modified one of the previous version
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: This article is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -.
Terminology
Abstract
This article is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -. Circulant graphs C n(R) and C n(S) are said to be Adam's isomorphic if there exist some a in Z n* such that S = a R under arithmetic reflexive modulo n. In 1970, Elspas and Turner raised a question on the isomorphism of C 16(1,3,7) and C 16(2,3,5). The author further modify the definition to m and m cubed are divisors of (n, r) and n, respectively, and r in R. Using the modified definition, we present our study on Type-2 isomorphism of circulant graphs C n(R) w.r.t. m = 2. We reprove that (i) C 16(1,2,7) and C 16(2,3,5) are Type-2 isomorphic w.r.t. m = 2; (ii) For n at least 2, k at least 3, 1 at most 2s-1 at most 2n-1, n not equal to 2s-1, R = 2, 2s-1, 4n-(2s-1) and S = 2, 2n-(2s-1), 2n+2s-1, C 8n(R) and C 8n(S) are Type-2 isomorphic w.r.t. m = 2, n,s in N; and (iii) For n at least 2, 1 at most 2s-1 < 2s'-1 at most [n over 2], 0 at most t at most [n over 2], R = 2,2s-1, 2s'-1 and n,s,s'in N, if θ n,2,t(C n(R)) and C n(R) are isomorphic circulant graphs of Type-2 w.r.t. m = 2 for some t, then n 0 (mod 8), 2s-1+2s'-1 = n over 2, 2s-1 not equal to n over 8, t = n over 8 or 3n over 8, 1 at most 2s-1 at most n over 4 and n at least 16 where θ n,m,t is a transformation used to define Type-2 isomorphism of a circulant graph. At the end, we present a VB program POLY215.EXE which shows how Type-2 isomorphism w.r.t. m = 2 of C 8n(R) takes place for R = 2, 2s-1, 4n-(2s-1), n at least 2 and n,s in N.
Sources
- A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27
- A study on Type-2 isomorphic circulant graphs and related Abelian groups
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality