Paired domination number of generalized Petersen graphs P(n, 2).
Ars Comb., 2017
Bounds on locating total domination number of the Cartesian product of cycles and paths.
Inf. Process. Lett., 2015
On Nonnegative Signed Domination in Graphs and its Algorithmic Complexity.
J. Networks, 2013
The Algorithmic Complexity of Reverse Signed Domination in Graphs.
Proceedings of the Information Computing and Applications - Third International Conference, 2012
Inverse Signed Total Domination Numbers of Some Kinds of Graphs.
Proceedings of the Information Computing and Applications - Third International Conference, 2012
On the Upper Bounds of Local Inverse Signed Edge Domination Numbers in Graphs.
Proceedings of the Information Computing and Applications - Third International Conference, 2012