Split Dominating Set of an Interval Graph Using an Algorithm.
A. Sudhakaraiah, V. Rama Latha · 2012
We study the problem of computing minimum dominating sets of n intervals on lines. Interval graphs are rich in combinatorial structures and have found applications in several disciplines such as traffic control, ecology, biology, computer sciences and pa rticularly useful in cyclic scheduling and computers storage allocation problems etc. In this paper we discussed the notions new algorithms for split domination in graphs using (minimum dominating set) MDS algorithm. We get many bounds and split domination number.