Abstract

Bi-Domination in Corona Related Graphs

V. Lavanya*1, D. S. T. Ramesh2 and N. Meena3

1Research Scholar, Department of Mathematics, Nazareth Margoschis College, Pillaiyanmanai,Thoothukudi-628617, Affiliated to Manonmaniam Sundaranar University, INDIA. 2Department of Mathematics, Nazareth Margoschis College, Pillaiyanmanai,Thoothukudi-628617, Affiliated to Manonmaniam Sundaranar University, INDIA. 3Department of Mathematics, The MDT Hindu College, Pettai, Tirunelveli- 627004, Affiliated to Manonmaniam Sundaranar University, INDIA.

ABSTRACT

Let G = (V, E) be a simple graph. A set S  V (G) is a bi-dominating set if S is a dominating set of G and every vertex in S dominates exactly two vertices in V-S. The bi-domination number G bi  of a graph G is the minimum cardinality of the minimal bi-dominating set. In this paper bi-domination number of corona related graphs are determined.

Keywords :Domination, Bi-domination and corona.

map1 map2 map3