# 2-Domination Number of Butterfly Graphs

CJM Vol. 1 No. 1 (June 2009), pp. 73 – 79.

Author(s):

Abstract:

A new family of graphs called Butterfly Graphs is introduced recently and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. In this paper, we find 2-dominating sets of Butterfly graph and show that 2-domination number of $BF(n)$ is

$\gamma_{×2}(BF(n)) = 2^n$  if $n = 2$

$\gamma_{×2}(BF(n)) = k \times 2^n + r \times 2^{n-1}$  if $n = 3k + r.$

AMS (MOS) Subject Classiﬁcation:

Full Paper (PDF):
AttachmentSize
203.52 KB