Total Bondage Number Of A Butterfly Graph

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 recently and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. Let S be a subset of the set E of edges of G. Then the total bondage number bt(G) of G, is the minimum cardinality among all sets S such that γt(G S) > γt(G). In this paper the values for total bondage number of butterfly graph of dimension n are presented.