A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs
math.CO
Submitted: 2026-05-13
Updated: 2026-10-27
Comments: Slightly modified one of its previous version
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Elspas and Turner raised a question on the isomorphism of C 16(1,3,7) and C 16(2,3,5) and Vilfred gave its answer by defining Type-2 isomorphism of C n(R) w.r.t.
Terminology
Abstract
Elspas and Turner raised a question on the isomorphism of C 16(1,3,7) and C 16(2,3,5) and Vilfred gave its answer by defining Type-2 isomorphism of C n(R) w.r.t. m m = (n, r) > 1 and also modified to m and m cubed divides (n, r) and n, respectively, r in R and r,n in N and studied such graphs. Using a C++ computer program, the authors obtained families of Type-2 isomorphic C n(R) w.r.t. m = 2,3,5,7 for n in N as well as C np cubed(R) w.r.t. m = p where p is a prime and n in N. In this paper, we present the C++ program and also a VB program POLY415.EXE which is used to show how Type-1 and Type-2 isomorphisms of a circulant graph take place as well as for checking and finding Type-1 and Type-2 circulant graphs of a given order. This article is the 9 th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -.
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