A study on Type-2 isomorphic circulant graphs. Part 10: Type-2 isomorphic C np cubed(R) w.r.t. m = p and related groups
math.CO
Submitted: 2022-11-13
Updated: 2026-10-27
Comments: This is a slightly modified version of its previous submission
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: This article is the 10 th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -.
Terminology
Abstract
This article is the 10 th part of a detailed study on Type-2 isomorphic circulant graphs having ten parts -. In this part, we obtain families of Type-2 isomorphic circulant graphs C np cubed(R) w.r.t. m = p, and related Abelian groups where p is a prime number and n in N. Theorems and are the main results. In Theorem, it is proved that for i = 1 to p, circulant graphs C np cubed(R np cubed,x+yp i) are isomorphic of Type-2 w.r.t. m = p and they form Abelian group (T2 np cubed,p(C np cubed(R np cubed,x+yp i)),) where T2 np cubed,p(C np cubed(R np cubed,x+yp i)) = θ np cubed,p,jn(C np cubed(R np cubed,x+yp i)) = C np cubed(R np cubed,x+yp i+j): j = 0,1,...,p-1 and i+j in C np cubed(R np cubed,x+yp i+j) is calculated under addition modulo p, 1 at most x at most p-1, 0 at most y at most np - 1, 1 at most x+yp at most np 2-1, y in N 0, p,np 3-p in R np cubed,x+yp i and i,n,x in N. Using Theorem, a list of T2 np cubed,p(C np cubed(R np cubed,x+yp i)), each containing p isomorphic circulant graphs C np cubed(R np cubed,x+yp i) of Type-2 w.r.t. m = p, for p = 3,5,7, n = 1,2 and y = 0 is given in the Annexure and more such families of Type-2 isomorphic circulant graphs are presented in.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality