相关论文: A study on Type-2 isomorphic circulant graphs. PAR…
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…
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 $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…
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)$,…
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 $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 $10^{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 obtain families of Type-2 isomorphic circulant graphs $C_{np^3}(R)$ w.r.t. $m$ = $p$, and…
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…
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…
The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…
The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…
The c_2 invariant, defined by Schnetz in 2011, is an arithmetic graph invariant created towards a better understanding of Feynman integrals. This paper looks at some graph families of interest, with a focus on decompleted toroidal grids.…
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This…