Abstract
A set S of vertices in a graph called a dominating set if every vertex either is in S or is adjacent to at least one vertex in S .The domination number of a graph G denoted by is the minimum size of the dominating sets of G. In this paper we studied the domination number, independent, restrained, total and connected domination number in Musical graphs.
Keywords