A set S of vertices in a graph G is a dominating set if every vertex of G is either in S or in adjacent to some vertex of S. If S is independent, then S is called an independent dominating set. The domination problem is to determine a dominating set of minimum cardinality. Independent domination problem is defined similarly. A Wrapped butterfly network WBF(n), n = 3, is obtained by merging the first and last levels of a butterfly network BF(n), n = 3, In this paper we determine upper bounds for the domination and total domination numbers of WBF(n). © 2020 The Authors. Published by Elsevier B.V.