Author of the publication

Bounds on locating total domination number of the Cartesian product of cycles and paths.

, and . Inf. Process. Lett., 115 (12): 950-956 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Bounds on locating total domination number of the Cartesian product of cycles and paths., and . Inf. Process. Lett., 115 (12): 950-956 (2015)The Algorithmic Complexity of Reverse Signed Domination in Graphs., , , , and . ICICA (2), volume 308 of Communications in Computer and Information Science, page 791-796. Springer, (2012)Inverse Signed Total Domination Numbers of Some Kinds of Graphs., , and . ICICA (2), volume 308 of Communications in Computer and Information Science, page 315-321. Springer, (2012)On Nonnegative Signed Domination in Graphs and its Algorithmic Complexity., , , and . J. Networks, 8 (2): 365-372 (2013)On the Upper Bounds of Local Inverse Signed Edge Domination Numbers in Graphs., , , and . ICICA (1), volume 307 of Communications in Computer and Information Science, page 368-372. Springer, (2012)Paired domination number of generalized Petersen graphs P(n, 2)., , and . Ars Comb., (2017)