To find a non-split strong dominating set of an interval graph using an algorithm
A. Sudhakaraiah · IOSR Journal of Mathematics · 2013
In graph theory, a connected component of an undirected graph is a sub graph in which any two vertices are connected to each other by paths.For a graph G, if the subgraph of G itself is a connected component then the graph is called connected, else the graph G is called disconnected and each connected component sub graph is called it's components.A dominating set D st of graph G=(V,E) is a non-split strong dominating set if the induced sub graph is connected.The non-split strong domination number of G is the minimum cardinality of a non-split strong dominating set .In this paper constructed a verification method algorithm for finding a non-split strong dominating set of an interval graph.