summary:A directed Cayley graph $C(\Gamma ,X)$ is specified by a group $\Gamma $ and an identity-free generating set $X$ for this group. Vertices of $C(\Gamma ,X)$ are elements of $\Gamma $ and there is a directed edge from the vertex $u$ to the vertex $v$ in $C(\Gamma ,X)$ if and only if there is a generator $x \in X$ such that $ux = v$. We study graphs $C(\Gamma ,X)$ for the direct product $Z_m \times Z_n$ of two cyclic groups $Z_m$ and $Z_n$, and the generating set $X = \{ (0,1), (1, 0), (2,0), \dots , (p,0) \}$. We present resolving sets which yield upper bounds on the metric dimension of these graphs for $p = 2$ and $3$
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lowe...
A metric generator is a set W of vertices of a graph G(V,E) such that for every pair of vertices u,v...
AbstractGiven a set of vertices S={v1,v2,…,vk} of a connected graph G, the metric representation of ...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
A set \(W\subseteq V(G)\) is called a resolving set, if for each pair of distinct vertices \(u,v\in ...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Abstract. A set of vertices S resolves a graph G if every vertex is uniquely determined by its vecto...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
Given a finite symmetric group S_n and a set S of generators, we can represent the group as a Cayley...
Let [Formula: see text] be a group and [Formula: see text] be a descending sequence of finite-index ...
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the repr...
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the rep...
AbstractGiven a set of vertices S={v1,v2,…,vk} of a connected graph G, the metric representation of ...
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lowe...
A metric generator is a set W of vertices of a graph G(V,E) such that for every pair of vertices u,v...
AbstractGiven a set of vertices S={v1,v2,…,vk} of a connected graph G, the metric representation of ...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
A set \(W\subseteq V(G)\) is called a resolving set, if for each pair of distinct vertices \(u,v\in ...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Abstract. A set of vertices S resolves a graph G if every vertex is uniquely determined by its vecto...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
Given a finite symmetric group S_n and a set S of generators, we can represent the group as a Cayley...
Let [Formula: see text] be a group and [Formula: see text] be a descending sequence of finite-index ...
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the repr...
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the rep...
AbstractGiven a set of vertices S={v1,v2,…,vk} of a connected graph G, the metric representation of ...
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lowe...
A metric generator is a set W of vertices of a graph G(V,E) such that for every pair of vertices u,v...
AbstractGiven a set of vertices S={v1,v2,…,vk} of a connected graph G, the metric representation of ...