Families of Type-2 Isomorphic Circulant Graphs of Order np^3 w.r.t. r = p and Their Abelian Groups
From MaRDI portal
Publication:6417093
arXiv2211.06970MaRDI QIDQ6417093FDOQ6417093
Authors: Vilfred Kamalappan, Wilson Peraprakash
Publication date: 13 November 2022
Abstract: Circulant graphs and are said to be emph{Adam's isomorphic} if there exist some such that under arithmetic reflexive modulo . is said to have {it Cayley Isomorphism} (CI)-property if whenever is isomorphic to they are of Adam's isomorphic. CI-problem determines which graphs (or which groups) have the -property. Classification of cyclic -groups was completed but investigation of graphs without -property is not much done. Vilfred defined Type-2 isomorphism, different from Adam's isomorphism, of circulant graphs w.r.t. , . Type-2 isomorphic circulant graphs don't have CI-property and we obtained such graphs of order for = 2,3,5,7, . In this paper, we obtain Type-2 isomorphic circulant graphs of order w.r.t. , and abelian groups on these isomorphic graphs where is a prime number and . Theorems
ef{c10} and
ef{c13} are the main results. Using Theorem
ef{c13}, a list of abelian groups on the isomorphic circulant graphs of Type-2 w.r.t. for = 1 to and for = 3,5,7, = 1,2 and = 0 is given in the Annexure, , , , , and .
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)
This page was built for publication: Families of Type-2 Isomorphic Circulant Graphs of Order $np^3$ w.r.t. $r = p$ and Their Abelian Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417093)