Author(s): Dr.A.Sudhakaraiah, E. Gnana Deepika, V. Rama Latha
Published in: International Journal of Engineering Research & Technology
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Volume/Issue: Vol.1 - Issue 3 ( May- 2012)
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 a connected component then the graph disconnected and each connected component subgraphs is called its components. A dominating D a of graph G is the minimum cardinality of a non- split dominating set. The 2-tuple domination problem is to find a minimum size vertex subset connected. The non-split dominating number such that every vertex in the graph is dominated by at least 2 vertices in the set. In this paper we discussed an algorithm to find a 2-tuple dominating set of an induced subgraph of a non-split dominating set of an interval graph. G is called connected, else the graph G V E ( , ) is a non-split dominating set, if the induced subgraph V D ns G of
Number of Citations for this article: Data not Available
7 Paper(s) Found related to your topic:
Publish your Ph.D/Master's Thesis Online