The Existence of Selfcomplementary Circulant Graphs
- Fronček, Dalibor
- Rosa, Alexander
- Širáň, Jozef
DOIAbstract
AbstractAll values ofnfor which there exist a selfcomplementary circulant graph of ordernare determined
AbstractAll values ofnfor which there exist a selfcomplementary circulant graph of ordernare determined
summary:We study a particular digraph dynamical system, the so called digraph diclique operator. Dic...
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Vi...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
In this paper, we study the self-complementary Cayley graphs and count the number of isomorphic clas...
AbstractThe main topic of the paper is the question of the existence of self-complementary Cayley gr...
We find a necessary and sufficient condition for the existence of SEDF in circulant graphs in terms ...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
AbstractAn almost self-complementary graph is a graph isomorphic to its complement minus a 1-factor....
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
The self‐complement index s(G) of a graph G is the maximum order of an induced subgraph of G whose c...
Dottorato di ricerca in matematica computazionale e ricerca operativa. 11 ciclo. Coordinatori Bruno ...
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with ...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
summary:We study a particular digraph dynamical system, the so called digraph diclique operator. Dic...
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Vi...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
In this paper, we study the self-complementary Cayley graphs and count the number of isomorphic clas...
AbstractThe main topic of the paper is the question of the existence of self-complementary Cayley gr...
We find a necessary and sufficient condition for the existence of SEDF in circulant graphs in terms ...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
AbstractAn almost self-complementary graph is a graph isomorphic to its complement minus a 1-factor....
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
The self‐complement index s(G) of a graph G is the maximum order of an induced subgraph of G whose c...
Dottorato di ricerca in matematica computazionale e ricerca operativa. 11 ciclo. Coordinatori Bruno ...
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with ...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
summary:We study a particular digraph dynamical system, the so called digraph diclique operator. Dic...
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Vi...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
Add to ORKG