k-Isolate Domination Number of Total Graphs
G. Rajasekar, Jeslet Kani Bala A · Journal of Emerging Technologies and Innovative Research · 2021
A dominating set S of a graph G is said to be a k -isolate dominating set if S has at least k -isolated vertices. In this paper, k -isolate domination number of Total graph of Path, cycle, and comb graphs are found.