P. Sharifani

activity

20102026

most citedCharacterizing extremal graphs for open neighbourhood location-domination

10 citations · 13 across the 10 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

cs.DM2017

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs

M. Rajaati, P. Sharifani, A. Shakiba +2

A mixed dominating set $S$ of a graph $G = (V, E)$ is a subset $S \subseteq V \cup E$ such that each element $v \in (V \cup E) ∖ S$ is adjacent or incident to at least one ele…

cs.DM2017

Some Results on [1, k]-sets of Lexicographic Products of Graphs

P. Sharifani, M. R. Hooshmandasl

A subset $S \subseteq V$ in a graph $G = (V, E)$ is called a $[1, k]$ -set, if for every vertex $v \in V ∖ S$ , $1 \leq ∣ N_{G} (v) \cap S ∣ \leq k$ . The $[1, k]$ -domination numbe…

cs.DM2017

A Linear Algorithm for Computing $γ_{[1, 2]}$ -set in Generalized Series-Parallel Graphs

P. Sharifani, M. R. Hooshmandasl

For a graph $G = (V, E)$ , a set $S \subseteq V$ is a $[1, 2]$ -set if it is a dominating set for $G$ and each vertex $v \in V ∖ S$ is dominated by at most two vertices of $S$ , i…

cs.DM2017

An Explicit Construction of Optimal Dominating Sets in Grid

P. Sharifani, M. R. Hooshmandasl, M. Alambardar Meybodi

A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V ∖ D$ is a neighbor of some vertex of $D$ . The domination number of $G$ is the minimu…

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs

Some Results on [1, k]-sets of Lexicographic Products of Graphs

A Linear Algorithm for Computing γ[1,2]​-set in Generalized Series-Parallel Graphs

An Explicit Construction of Optimal Dominating Sets in Grid

A Linear Algorithm for Computing $γ_{[1, 2]}$ -set in Generalized Series-Parallel Graphs