Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
extension 1
citation-polarity summary
fields
math.CO 3roles
extension 1polarities
extend 1representative 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.
Reports 8 pairs of Type-2 isomorphic circulant graphs for order 16, 32 pairs for order 24, and 12 triples for order 27 using a modified definition of Type-2 isomorphism.
citing papers explorer
-
A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\&$ -2 isomorphic circulant graphs
Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.
-
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 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27
Reports 8 pairs of Type-2 isomorphic circulant graphs for order 16, 32 pairs for order 24, and 12 triples for order 27 using a modified definition of Type-2 isomorphism.