Bondage Number of a Butterfly Graph

Abstract

Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S  E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.