Let G = V, E be a simple graph. A subset D of V G is called a total strong dominating set of G, if for every u V G , there exists a v D such that u and v are adjacent and deg v = deg u . The minimum cardinality of a total strong dominating set of G is called total strong domination number of G and is denoted by s t G . Corresponding to total strong dominating...
Showing posts with label Total Strong Dominating Function. Show all posts
Showing posts with label Total Strong Dominating Function. Show all posts
