A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs

@misc{kamalappan2026study,
  title = {{A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\&$ -2 isomorphic circulant graphs}},
  author = {Vilfred Kamalappan and Wilson Peraprakash},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2605.14140},
  eprint = {2605.14140},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.14140},
  note = {CC BY-NC-SA 4.0},
}

TY  - UNPB
TI  - A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs
AU  - Vilfred Kamalappan
AU  - Wilson Peraprakash
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2605.14140
UR  - https://arxiv.org/abs/2605.14140
AB  - Elspas and Turner \cite{eltu} raised a question on the isomorphism of C_16(1,3,7) and C_16(2,3,5) and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of C_n(R) w.r.t. m ∋ m = gcd(n, r) > 1 and also modified to m and m^3 divides gcd(n, r) and n, respectively, r∈ R and r,n∈ℕ and studied such graphs \cite{v13,v20, v2-1}. 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∈ℕ as well as C_np^3(R) w.r.t. m = p where p is a prime and 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 \cite{v2-1}-\cite{v2-10}.
ER  -