On the Bounds of the Domination Numbers of Glued Graphs

Abstract

We obtain a lower bound and an upper bound of the domination numbers of glued graphs, based on those of the original graphs. We also investigate the domination numbers of glued graphs whose clones are paths and the original graphs are in some specific families of bipartite graphs, namely bipartite fan graphs and firecrackers F cn,3 . Consequently, we use these results to show that our obtained bounds are sharp.