Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
P. Usha · viXra · 2014
A dominating set of a graph �(G), is a total lict dominating set if the dominating set does not contain any isolates. The total lict dominating number t(�(G)) of G is a minimum cardinality of total lict dominating set of G. The current paper studies total lict domination in graph from an algorithmic point of view. In particular we had obtained the algorithm for a total lict domination number of any graph. Also we had obtained the time complexity of a proposed algorithm. Further we discuss the NP-Completeness of a total lict domination number of the split graph, bipartite graph and chordal graph.