All 384 pairs of Type-2 isomorphic circulant graphs C_32(R) have been obtained.
A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
abstract
This study is the $2^{nd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Definition of Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ was further modified by the author by considering $m > 1$ divides $\gcd(n, r)$, $m^3$ divides $n$ and $r\in R$ and studied Type-2 isomorphic circulant graphs w.r.t. $m$ = 2. This modification simplifies our calculations while finding isomorphic circulant graphs of Type-2. In this paper, using the modified definition \ref{d4.2}, we obtain Type-2 isomorphic circulant graphs of orders 16, 24 and 27 and show that the total number of pairs of Type-2 isomorphic circulant graphs of orders 16 and 24 are 8 and 32, respectively and the total number of triples of Type-2 isomorphic circulant graphs of order 27 are 12.
citation-role summary
extension 1
method 1
citation-polarity summary
fields
math.CO 7years
2026 7verdicts
UNVERDICTED 7representative citing papers
Defines isomorphism series, digraph D, and graph G for circulant graphs C_n(R) and computes them for C_16(R), C_27(S), several C_54 sets, and C_432 while identifying some isomorphisms that are neither Type-1 nor Type-2 w.r.t. m=3.
V_{n,m}(C_n(R)) forms an Abelian group under ∘ and T2_{n,m}(C_n(R)) is a subgroup, where T2 collects C_n(R) and all its Type-2 isomorphic copies w.r.t. m.
There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3.
Certain circulant graphs C_16(1,2,7) and C_16(2,3,5) are Type-2 isomorphic w.r.t. m=2, and for n>=2 families C_8n(R) with R={2,2s-1,4n-(2s-1)} and C_8n(S) are Type-2 isomorphic w.r.t. m=2 under stated conditions on n and s.
Two families of circulant graphs C_432(R) and C_6750(S) each possess Type-2 isomorphic variants for two values of m.
Enumeration yields 18 Type-2 isomorphic pairs for n=48, 72 pairs for n=96, and 27 triples for n=81 among circulant graphs C_n with 3 or 4 generators.
citing papers explorer
-
A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs $C_{32}(R)$
All 384 pairs of Type-2 isomorphic circulant graphs C_32(R) have been obtained.
-
A study on Type-2 isomorphic circulant graphs. Part 7: Isomorphism series, digraph and graph of $C_n(R)$
Defines isomorphism series, digraph D, and graph G for circulant graphs C_n(R) and computes them for C_16(R), C_27(S), several C_54 sets, and C_432 while identifying some isomorphisms that are neither Type-1 nor Type-2 w.r.t. m=3.
-
A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups $(T2_{n,m}(C_n(R)), \circ)$ and $(V_{n,m}(C_n(R)), \circ)$
V_{n,m}(C_n(R)) forms an Abelian group under ∘ and T2_{n,m}(C_n(R)) is a subgroup, where T2 collects C_n(R) and all its Type-2 isomorphic copies w.r.t. m.
-
A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs $C_{54}(R)$
There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3.
-
A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs $C_n(R)$ w.r.t. $m$ = 2
Certain circulant graphs C_16(1,2,7) and C_16(2,3,5) are Type-2 isomorphic w.r.t. m=2, and for n>=2 families C_8n(R) with R={2,2s-1,4n-(2s-1)} and C_8n(S) are Type-2 isomorphic w.r.t. m=2 under stated conditions on n and s.
-
A Study on Type-2 Isomorphic Circulant Graphs: Part 8: $C_{432}(R)$, $C_{6750}(S)$ -- each has 2 types of Type-2 isomorphic circulant graphs
Two families of circulant graphs C_432(R) and C_6750(S) each possess Type-2 isomorphic variants for two values of m.
-
A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
Enumeration yields 18 Type-2 isomorphic pairs for n=48, 72 pairs for n=96, and 27 triples for n=81 among circulant graphs C_n with 3 or 4 generators.