To Find Strong Dominating Set and Split Strong Dominating Set of an Interval Graph Using an Algorithm
A. Sudhakaraiah, V. Rama Latha, E. Gnana Deepika · 2012
Strong and weak domination arise naturally in certain practical situations. For example, consider a network of roads connecting a number of locations. In such a network, the degree of a vertex v is the number of roads meeting at v. Suppose degu � deg v. Naturally, the traffic at u is heavier than that at v. If we consider the traffic between u and v, preference should be given to the vehicles going from u to v. Thus, in some sense, u strongly dominates v and v weakly dominates u. In this paper we present an algorithm to find a strong dominating set and split strong dominating set of an interval graph which is connected.