A study on Type-2 isomorphic circulant graphs. Part 8: Isomorphism series, digraph and graph of C n(R)
math.CO
Submitted: 2026-06-18
Updated: 2026-10-27
Comments: This article contains 79 pages. Previous version of Part 7 and Part 8 are interchanged, modified and developed to this stage
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: This article is the 8 th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -.
Terminology
Abstract
This article is the 8 th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -. In this study, we define isomorphic set, isomorphism series, isomorphism digraph or isomorphism diagram D and isomorphism graph G of circulant graphs and obtain these corresponding to C 16(R), C 27(S) and C 54(1,3,17,19) and present the isomorphism digraph and the isomorphism graph of C 432(T) which has isomorphic circulant graphs of Type-2 w.r.t. m = 2,3 and of C 6750(U) which has isomorphic circulant graphs of Type-2 w.r.t. m = 3,5 where T = 16, 27, 48, 54, 128, 160, 189 and U = 135, 243, 250, 750, 1107, 1593, 2000, 2457, 2500, 2943. We also define diameter of isomorphic set of C n(R) and isomorphic distance between any two circulant graphs. We find that the order of isomorphic sets of C 432(T) and C 6750(U) are 36 and 450 and their diameters are 3 and 3, respectively.
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