M. Tavakoli

activity

20182023

most citedSome binary products and integer linear programming for computing

k

-metric dimension of graphs

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

Global forcing number for maximal matchings in corona products

Sandi Klavžar, Mostafa Tavakoli, Gholamreza Abrishami

A global forcing set for maximal matchings of a graph $G = (V (G), E (G))$ is a set $S \subseteq E (G)$ such that $M_{1} \cap S \neq = M_{2} \cap S$ for each pair of maximal matchings $M_{1}$ an…

math.CO2021★ 2 cited

Some binary products and integer linear programming for computing $k$ -metric dimension of graphs

Sandi Klavžar, Freydoon Rahbarnia, Mostafa Tavakoli

Let $G$ be a connected graph. For an ordered set $S = {v_{1}, \dots, v_{ℓ}} \subseteq V (G)$ , the vector $r_{G} (v ∣ S) = (d_{G} (v_{1}, v), \dots, d_{G} (v_{ℓ}, v))$ is called the metric $S$ -repr…

Global forcing number for maximal matchings in corona products

Some binary products and integer linear programming for computing k-metric dimension of graphs

Some binary products and integer linear programming for computing $k$ -metric dimension of graphs