Maxima (or) Minima of Independent Domination Number in Planar Graph

Main Article Content

A.D.CHANDRASEKARAN, S M CHITHRA, Dr. Pavithra G, M SRIDHARAN, N. Subashini

Abstract

A graph G consists of a pair (V (G), X (G)) where V(G) is a non-empty finite set whose elements are called points or vertices and  (G) is a set of unordered pairs of distinct element of V(G). In graph theory, planar graph is also be one of the part. A graph G is said to be a planar if it can be represent on a plane in such a fashion that the vertices are all distinct points, edges and no two edges meet one another except their terminals. A set S of vertices of G is dominating set if every vertex in V (G) is adjacent to at least one vertex in S. In this paper, we have founded the result on independent domination in planar graph.

Article Details

How to Cite
N. Subashini, A. S. M. C. D. P. G. M. S. . (2021). Maxima (or) Minima of Independent Domination Number in Planar Graph. Annals of the Romanian Society for Cell Biology, 25(6), 1132–1135. Retrieved from https://annalsofrscb.ro/index.php/journal/article/view/5597
Section
Articles