1 citations · 1 across the 4 of their papers we have counts for
8 papers
W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs
Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba
A set of a graph is called an outer-connected dominating set of if every vertex not in is adjacent to at least one vertex in , and the in…
On Mixed Domination in Generalized Petersen Graphs
M. Rajaati, M. R. Hooshmandasl, M. Alambardar Meybodi +1
Given a graph , a set of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in happens to be a…
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . Fomin et al.[9] gave an algorithm for…
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
M. Hashemipour, M. R. Hooshmandasl, A. Shakiba
Let be a graph. A subset is a dominating set of if every vertex not in is adjacent to a vertex in . A set of a graph $G…
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
M. Rajaati, P. Sharifani, A. Shakiba +2
A mixed dominating set of a graph is a subset such that each element is adjacent or incident to at least one ele…
Some Results on [1, k]-sets of Lexicographic Products of Graphs
P. Sharifani, M. R. Hooshmandasl
A subset in a graph is called a -set, if for every vertex , . The -domination numbe…