1Department of Mathematics, Acharya Institute of Technology, Bangalore, India
2Department of Applied Mathematics, Sri Padmavati Mahila Visvavidyalayam, Tirupati, India
Online published on 21 November, 2017.
Butterfly graphs are very important structures in computer architecture and communication techniques. Total Domination is an important parameter as it ensures connectivity in the network even after failure of few of the communication points. In this paper we find total domination number of BF(n) and deduce a relation between the domination number and total domination number of BF(n) as
γt (BF(2)) = 22 = γ (BF(2)) + 2
γt (BF(3)) = 23 = γ (BF(3)) + 2
γt (BF(n)) = γ (BF(n)) for n > 2
Butterfly graph, domination number, total domination number
