  In this paper, we study the domination number of middle graphs. Indeed, we
obtain tight bounds for this number in terms of the order of the graph. We also
compute the domination number of some families of graphs such as star graphs,
double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs,
complete bipartite graphs and friendship graphs, explicitly. Moreover, some
Nordhaus-Gaddum-like relations are presented for the domination number of
middle graphs.
