This is an outdated version published on 2022-06-01. Read the most recent version.
Bi-Domination in Brick product graphs
Main Article Content
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
Issue
Section
Articles