1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
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…
cs.DM2018
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…