Related papers: A study on Type-2 isomorphic circulant graphs. Par…
Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in \mathbb{Z}_n^*$ such that $S = a R$ under arithmetic reflexive modulo $n$. In 1970, Elspas and Turner \cite{eltu} raised a question on…
This study is the $6^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this part, we define $V_{n,m}(C_n(R))$ and Type-2 set $T2_{n,m}(C_n(R))$ of $C_n(R)$ and present their…
This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…
This study is the $5^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of $C_{48}(r_1,r_2,r_3)$,…
This study is the $2^{nd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Definition of Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ was further modified by the author…
In this study, we obtain the following two families of circulant graphs each has Type-2 isomorphic circulant graphs w.r.t. $m$ such that $m$ has more than one value. (i) Family of circulant graphs $C_{432}(R)$, each has isomorphic circulant…
This study is the $3^{rd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 2. Here, we obtain all the 384 pairs of Type-2 isomorphic circulant graphs of…
Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\ni$ $m$ = $\gcd(n, r) > 1$, $r\in R$…
This study is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 3. Here, we study Type-2 isomorphic circulant graphs of order 54 and show that…
A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different…
Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represented in detail here together with intermediate and final…
In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…
The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…
Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…
This paper considers the degree-diameter problem for undirected circulant graphs. For degrees 10 and 11 newly discovered families of circulant graphs of arbitrary diameter are presented which are largest known and are conjectured to be…
In the present paper we compute the Jacobian group of $\Delta$-graph $\Delta(n; k, l, m).$ The notion of $\Delta$-graph continues the list of families of $I$-, $Y$- and $H$-graphs well-known in the graph theory. In particular, graph…
A graph is said to be $k$-{\em isoregular} if any two vertex subsets of cardinality at most $k$, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no $3$-isoregular bicirculant (and more…