Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 17 min ago
PreprintCC BY-NC-SA 4.0arXiv

A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96

Abstract

This article is the 5th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of C48(r1,r2,r3), C81(r1,r2,r3) and C96(r1,r2,r3,r4). We find that for n = 48,96, total number of pairs of isomorphic circulant graphs of Type-2 w.r.t. m = 2 of the forms Cn(r1,r2,r3) and Cn(s1,s2,s3) are 18 and 72, respectively, and total number of triples of isomorphic circulant graphs of Type-2 w.r.t. m = 3 of the form C81(x1,x2,x3), C81(y1,y2,y3) and C81(z1,z2,z3) are 27.

Related

  1. A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs C32(R)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs C54(R)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. A Study on Type-2 Isomorphic Circulant Graphs: Part 7: C432(R), C6750(S) - each has 2 types of Type-2 isomorphic circulant graphs
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs
    Vilfred Kamalappan, Wilson Peraprakash
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs Cn(R) w.r.t. m = 2
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{kamalappan2026study,
  title = {{A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96}},
  author = {Vilfred Kamalappan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2605.12390},
  eprint = {2605.12390},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.12390},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
AU  - Vilfred Kamalappan
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2605.12390
UR  - https://arxiv.org/abs/2605.12390
AB  - This article is the 5^th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of C_48(r_1,r_2,r_3), C_81(r_1,r_2,r_3) and C_96(r_1,r_2,r_3,r_4). We find that for n = 48,96, total number of pairs of isomorphic circulant graphs of Type-2 w.r.t. m = 2 of the forms C_n(r_1,r_2,r_3) and C_n(s_1,s_2,s_3) are 18 and 72, respectively, and total number of triples of isomorphic circulant graphs of Type-2 w.r.t. m = 3 of the form C_81(x_1,x_2,x_3), C_81(y_1,y_2,y_3) and C_81(z_1,z_2,z_3) are 27.
ER  -