Circulant graphs and are said to be \emph{Adam’s isomorphic} if there exist some such that under arithmetic reflexive modulo . In 1970, Elspas and Turner \cite{eltu} raised a question on the isomorphism of and and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism, different from Adam’s isomorphism or Type-1 isomorphism, of w.r.t. where $m
1\gcd(n, r)r\in R$. This paper is an extensive study on Type-2 isomorphic circulant graphs. Vilfred and Wilson \cite{vw0A} obtain isomorphic circulant graphs of Type-2 w.r.t. = , and related Abelian groups where is a prime number and . Using Theorem \ref{c13}, a list of = for = 3,5,7,11 and = 1 to 5 and also for = 13 and = 1 to 3 are given in the Annexure where is an abelian group on the isomorphic circulant graphs of Type-2 w.r.t. = , , , , $0 \leq y \leq np - 11 \leq x+yp \leq np^2-1p,np^3-p\in R^{np^3,x+yp}_ii,j,n,x\in$. We also show existence of isomorphic circulant graphs and which are neither Type-1 nor Type-2 w.r.t. any particular . We use VB program to develop this theory and for illustration of examples.

生成讲解博客的中文版本

生成AI智能校验的中文版本