We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, with all possible generating sets containing four elements, up to isomorphism. We find out that the order 17 is the smallest case providing two non-isomorphic 4-regular circulant graphs with the same Wiener index. Some open problems and questions are listed
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
AbstractA classification of strongly regular Cayley graphs of cyclic group was independently achieve...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractThe correspondence between finite abelian groups and their Cayley graphs is studied in the c...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
© 2016 Dr. Hamid MokhtarCayley graphs are highly attractive structures for communication networks be...
A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourt...
Abstract. We prove that any circulant graph of order n with connection set S such that n and the ord...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
AbstractA classification of strongly regular Cayley graphs of cyclic group was independently achieve...
We investigate conditions for isomorphism between circulant graphs and analyze their automorphism gr...
AbstractThe correspondence between finite abelian groups and their Cayley graphs is studied in the c...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
© 2016 Dr. Hamid MokhtarCayley graphs are highly attractive structures for communication networks be...
A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourt...
Abstract. We prove that any circulant graph of order n with connection set S such that n and the ord...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...