Reserved Domination Number of some Graphs

Main Article Content

Dr. G. Rajasekar, et. al.

Abstract

In this paper the definitions of Reserved domination number and 2-reserved domination number are introduced as for the graph   a subset of is called a Reserved Dominating Set of  if (i)be any nonempty proper subset of ;   (ii) Every vertex in  is adjacent to a vertex in. The dominating set is called a minimal reserved dominating set if no proper subset of containing is a dominating set.  The set  is called Reserved set. The minimum cardinality of a reserved dominating set of is called the reserved domination number ofand is denoted by where  is the number of reserved vertices. Using these definitions the 2-reserved domination number for Path graph , Cycle graph , Wheel graph , Star graph , Fan graph , Complete graph  and Complete Bipartite graph  are found.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
et. al., D. G. R. . (2021). Reserved Domination Number of some Graphs. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(11), 2166–2181. https://doi.org/10.17762/turcomat.v12i11.6206
Section
Research Articles