Add to ORKGCirculant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs with at most $3$ generators has been extensively studied especially in the last decade. We extend known results in the area by presenting the lower and the upper bounds on the metric dimension of circulant graphs with $4$ generators
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
A metric generator is a set W of vertices of a graph G(V,E) such that for every pair of vertices u,v...
The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and ...
AbstractLet G=(V,E) be a connected graph and d(x,y) be the distance between the vertices x and yinV(...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
Let M =},...,, { 21 nvvv be an ordered set of vertices in a graph G. Then)),(),...,,(),,( ( 21 nvudv...
Circulant networks form a very important and widely explored class of graphs due to their interestin...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one s...
and other research outputs Bounds on the diameter of Cayley graphs of the sym-metric grou
summary:A directed Cayley graph $C(\Gamma ,X)$ is specified by a group $\Gamma $ and an identity-fre...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
A metric generator is a set W of vertices of a graph G(V,E) such that for every pair of vertices u,v...
The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and ...
AbstractLet G=(V,E) be a connected graph and d(x,y) be the distance between the vertices x and yinV(...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
Let M =},...,, { 21 nvvv be an ordered set of vertices in a graph G. Then)),(),...,,(),,( ( 21 nvudv...
Circulant networks form a very important and widely explored class of graphs due to their interestin...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one s...
and other research outputs Bounds on the diameter of Cayley graphs of the sym-metric grou
summary:A directed Cayley graph $C(\Gamma ,X)$ is specified by a group $\Gamma $ and an identity-fre...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
We compute the Wiener index and the Hosoya polynomial of the Cayley graph of some cyclic groups, wit...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...