Weak Domination in LICT Graphs
Mario F. Jimenez H., Geetadevi Baburao · International Journal of Computer Applications · 2020
The lict graph of a graph is the graph whose set of vertices is the union of set of edges and the set of cut vertices of in which two vertices are adjacent if and only if the corresponding edges are adjacent or the corresponding members of are incident.In this paper, we initiate the study of variation of standard domination, namely weak lict domination.A weak dominating set is a weak dominating set of if for every vertex there is a vertex with and is adjacent to A weak domination number of is denoted by is the smallest cardinality of a weak dominating set of We determine best possible upper and lower bounds for , in terms of elements of Keywords Domination, Double domination, restrained domination, weak domination, weak lict domination.