B. Omoomi

activity

20082019

most citedOn the Locating Chromatic Number of the Cartesian Product of Graphs

12 citations · 28 across the 18 of their papers we have counts for

collaborators

Showing 2011Show all

7 papers · 1 filter

math.CO2011★ 2 cited

Relations between Metric Dimension and Domination Number of Graphs

Behrooz Bagheri Gh., 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.CO2011★ 12 cited

On the Locating Chromatic Number of the Cartesian Product of Graphs

Ali Behtoei, Behnaz Omoomi

Let $c$ be a proper $k$ -coloring of a connected graph $G$ and $Π = (C_{1}, C_{2}, ..., C_{k})$ be an ordered partition of $V (G)$ into the resulting color classes. For a vertex $v$ of $G$ , the…

math.CO2011★ 1 cited

On the locating chromatic number of Kneser graphs

Ali Behtoei, Behnaz Omoomi

Let $c$ be a proper $k$ -coloring of a connected graph $G$ and $Π = (C_{1}, C_{2}, ..., C_{k})$ be an ordered partition of $V (G)$ into the resulting color classes. For a vertex $v$ of $G$ , the…

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

math.CO2011

On Randomly k-Dimensional Graphs

Mohsen Jannesari, Behnaz Omoomi