Bi-Domination in Brick product graphs

Main Article Content

Anjaneyulu Mekala, Vijaya Chandra Kumar U, Umesha N, R. Murali

Abstract

A non-empty set of vertices is a bi-domination set if  is dominating set of and every  dominates exactly two vertices in  such that .The bi-domination number  is the minimum cardinality over all bi-dominating set in . In this paper we determine bi-domination number  for the brick product graph of even cycle graphs.

Article Details

Section
Articles