On signed total domination concept of generalizedgraphs and networks

Let G=(V,E) be a graph. The function is a signed total domination function if for all vertices where is the open neighborhood of vertex v. The minimum of values of is called signed total domination number and denoted by The signed total domination concept is an lp integer programming and NP-hardness problem. In this paper, we initiate studying of signed total domination number for generalized graphs and networks.

کلیدواژه ها:

Signed total domination number ، Mysielski construction