Add to ORKGWe investigate the problem of decomposing the edges of a connected circulant graph with n vertices and generating set S into isomorphic subgraphs each having n edges. For 8-regular circulants, we show this is always possible when s + 2 ≤ n/4 for all edge lengths s ∈ S
Given two k element subsets S,T ⊆ ℤn, we give a quasi-linear algorithm to either find λ ∈ ℤ*n such t...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractWe present a formula to enumerate non-isomorphic circulant digraphs of order n with connecti...
We investigate the conjecture that every circulant graph X admits a k-isofactorization for every k d...
We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges de...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
We investigate a certain condition for isomorphism between circulant graphs (known as the Ádám prope...
C n (R) denotes circulant graph C_n(r_1,r_2,\ldots,r_k)C n (r 1 ,r 2 ,…,r ...
In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to wh...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractA subclass of the class of circulant graphs is considered. It is shown that in this subclass...
Necessary and sufficient conditions are given for the existence of isomorphic decompositions of the ...
Given two k element subsets S,T ⊆ ℤn, we give a quasi-linear algorithm to either find λ ∈ ℤ*n such t...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractWe present a formula to enumerate non-isomorphic circulant digraphs of order n with connecti...
We investigate the conjecture that every circulant graph X admits a k-isofactorization for every k d...
We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges de...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
We investigate a certain condition for isomorphism between circulant graphs (known as the Ádám prope...
C n (R) denotes circulant graph C_n(r_1,r_2,\ldots,r_k)C n (r 1 ,r 2 ,…,r ...
In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to wh...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractA subclass of the class of circulant graphs is considered. It is shown that in this subclass...
Necessary and sufficient conditions are given for the existence of isomorphic decompositions of the ...
Given two k element subsets S,T ⊆ ℤn, we give a quasi-linear algorithm to either find λ ∈ ℤ*n such t...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractWe present a formula to enumerate non-isomorphic circulant digraphs of order n with connecti...
