In this paper, we study the self-complementary Cayley graphs and count the number of isomorphic classes of undirected self-complementary circulants of order n, where n is square free.Mathematics, AppliedMathematicsSCI(E)中国科学引文数据库(CSCD)1ARTICLE2241-2461
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the di...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractThe main topic of the paper is the question of the existence of self-complementary Cayley gr...
AbstractAn almost self-complementary graph is a graph isomorphic to its complement minus a 1-factor....
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
C n (R) denotes circulant graph C_n(r_1,r_2,\ldots,r_k)C n (r 1 ,r 2 ,…,r ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractAll values ofnfor which there exist a selfcomplementary circulant graph of ordernare determi...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the di...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
AbstractThe main topic of the paper is the question of the existence of self-complementary Cayley gr...
AbstractAn almost self-complementary graph is a graph isomorphic to its complement minus a 1-factor....
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
C n (R) denotes circulant graph C_n(r_1,r_2,\ldots,r_k)C n (r 1 ,r 2 ,…,r ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
AbstractFor functions f : D → Rk where D is a finite set and Rk = {0,1,… k} we define complementary ...
AbstractAll values ofnfor which there exist a selfcomplementary circulant graph of ordernare determi...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractIn this paper a new algorithm is given for the construction of self-complementary graphs, an...
This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the di...
AbstractDe Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outlin...
DOI
Add to ORKG