TO FIND A NON-SPLIT RESTRAINED DOMINATING SETS OF INTERVAL GRAPH AND COMPARING RAINBOW CONNECTION NUMBER, DIAMETER, CARDINALITY OF RDS AND RADIUS OF THE INTERVAL GRAPHS
A. Sudhakaraiah, K. Ramakrishna, E. Gnana Deepika · 2014
Among the various applications of the theory of restrained domination, the most often discussed is communication network. There has been persistent in the Algorithmic aspects of interval graphs in past decades spurred much by their numerous applications of an interval graphs corresponding to an interval family I. A set () D V G ⊆ is a Restrained dominating set of a graph G , if every vertex not in D is adjacent to a vertex in D and to a vertex in VD − . In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths. For a graph G , if the induced subgraph of G itself is a connected component then the graph G is called connected. A Restrained dominating set RDS of a graph (, ) GV E is a Non-split restrained dominating set, if the induced subgraph V RDS is connected. In this paper we find a non-split restrained dominating set of an interval graph and compare the rainbow connection number, diameter, cardinality of RDS and radius of the interval graphs.