All 384 pairs of Type-2 isomorphic circulant graphs C_32(R) have been obtained.
Vilfred Kamalappan,A study on Type-2 isomorphic circulant graphs
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
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.
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 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 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.