6 citations · 9 across the 8 of their papers we have counts for
12 papers
Metric dimension of Cartesian product of stars
Akbar Davoodi, Mohsen Jannesari
The metric dimension of a graph is the minimum number of landmark vertices required so that every vertex can be uniquely identified by its distances to the landmarks. This paramete…
Metric dimension of lexicographic product of some known graphs
Mohsen Jannesari
For an ordered set W = {w1,w2,...,wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W) := (d(v,w1),d(v,w2),...,d(v,wk)) is called the (metric) represe…
On minimal doubly resolving sets in graphs
Mohsen Jannesari
Two vertices u,v of connected graph G are doubly resolved by x,y\in V(G)if d(v; x)-d(u; x)\neq d(v; y)-d(u; y): A set W of vertices of the graph G is a doubly resolving set for G i…
Graphs with constant adjacency dimension
Mohsen Jannesari
For a set W of vertices and a vertex v in a graph G, the k-vector r2(v|W) = (aG(v,w1),...,aG(v,wk)) is the adjacency representation of v with respect to W, where W = {w1,...,wk} an…
A characterization of some graphs with metric dimension two
Ali Behtoei, Akbar Davoodi, Mohsen Jannesari +1
A set W \subseteq V (G) is called a resolving set, if for each pair of distinct vertices u,v \in V (G) there exists t \in W such that d(u,t) \neq d(v,t), where d(x,y) is the distan…
Uniquely dimensional graphs
Behrooz Bagheri, Mohsen Jannesari, Behnaz Omoomi
A set is called a resolving set, if for each two distinct vertices there exists such that , where is the distan…