Comparative study of domination numbers of butterfly graph \(BF(n)\) (Q2912483)

Butterfly graphs, \(BF(n)\), are \(n\)-partite graphs with \(n\) partitions each of size \(2^n\). Each vertex in the partition \(L_i\) is adjacent with 2 vertices in the partition \(L_{i-1}\) and 2 vertices in the partition \(L_{i+1}\). Adjacency is based on the digital coding of vertices. In the paper there is given a comparison of dominating parameters of the class of butterfly graphs. Dominating parameters include domination number, total domination number, independent domination number, efficient domination and other generalizations of the domination number.