M. Jannesari

math.CO2011

Characterization of n-Vertex Graphs with Metric Dimension n-3

Mohsen Jannesari, Behnaz Omoomi

For an ordered set $W = {w_{1}, w_{2}, ..., w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the ordered $k$ -vector $r (v ∣ W) := (d (v, w_{1}), d (v, w_{2}), ..., d (v, w_{k}))$ is called the (m…

math.CO2011★ 6 cited

Characterization of Randomly k-Dimensional Graphs

Mohsen Jannesari, Behnaz Omoomi

For an ordered set $W = {w_{1}, w_{2}, ..., w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the ordered $k$ -vector $r (v ∣ W) := (d (v, w_{1}), d (v, w_{2}), ., d (v, w_{k}))$ is called the (met…

math.CO2011

The Metric Dimension of Lexicographic Product of Graphs

Mohsen Jannesari, Behnaz Omoomi

For an ordered set $W = {w_{1}, w_{2}, ..., w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the ordered $k$ -vector $r (v ∣ W) := (d (v, w_{1}), d (v, w_{2}), ..., d (v, w_{k}))$ is called the (m…

math.CO2011

On Randomly k-Dimensional Graphs

Mohsen Jannesari, Behnaz Omoomi

For an ordered set $W = {w_{1}, w_{2}, ..., w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the ordered $k$ -vector $r (v ∣ W) := (d (v, w_{1}), d (v, w_{2}), ..., d (v, w_{k}))$ is called the (m…