A REVIEW OF ISOLATED DOMINATION GRAPH

A REVIEW OF ISOLATED DOMINATION GRAPH
Author(s):
RANI
Keywords:
Domination, isolate, Moments, Parallel Force
Abstract
A set D of vertices of a graph G is called a dominating set of C if every vertex in V(G) - D is conterminous to a vertex in D. A dominating set S similar that the subgraph (S)convinced by .S' has at least one isolated vertex is called an isolate dominating set. An isolate dominating set none of whose proper subset is an isolate dominating set is a minimal isolate dominating set. The minimum and maximum cardinality of a minimal isolate dominating set are called the isolate domination number o and the upper isolate domination number o respectively. In this paper we initiate a study on these parameters.
Article Details
Unique Paper ID: 163071 Publication Volume & Issue: Volume 0, Issue no Page(s): 127 - 130
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org