M. Jannesari

activity

20112025

most citedCharacterization of Randomly k-Dimensional Graphs

6 citations · 9 across the 8 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012★ 1 cited

Uniquely dimensional graphs

Behrooz Bagheri, Mohsen Jannesari, Behnaz Omoomi

A set $W \subseteq V (G)$ is called a resolving set, if for each two distinct vertices $u, v \in V (G)$ there exists $w \in W$ such that $d (u, w) \neq = d (v, w)$ , where $d (x, y)$ is the distan…

math.CO2012

Extremal Graph Theory for Metric Dimension and Girth

Mohsen Jannesari

A set $W \subseteq V (G)$ is called a resolving set for $G$ , if for each two distinct vertices $u, v \in V (G)$ there exists $w \in W$ such that $d (u, w) \neq = d (v, w)$ , where $d (x, y)$ is th…