Edge Litact Domination in graphs

Abstract

In the manuscript the Edge litact domination number of the standard graphs like Cycle graph C_p wheel graph W_p  ,Complete graph K_p, Bi-partite graph K_(m,n), Trees, and so-on are calculated and tried to bring up the relationship between the edge  litact domination number of G with different specifications of G and also with other domination specifications of G. Further the Nordhaus- Gaddum types of results are also obtained.