Algorithmic complexity of secure connected domination in graphs

Algorithmic complexity of secure connected domination in graphs

Let be a simple, undirected, and connected graph. A connected (total) dominating set is a secure connected (total) dominating set of G, if for each there exists such that and is a connected (total) dominating set of G. The minimum cardinality of a secure connected (total) dominating set of G denoted...

Full description

Bibliographic Details
Main Authors: J. Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
Format: Article
Language:English
Published: Taylor & Francis Group 2020-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
domination
secure domination
secure connected domination
w[2]-hard
Online Access:http://dx.doi.org/10.1016/j.akcej.2019.08.012

Similar Items

Similar Items