On the Independent, Restrained, Total and Connected Domination Number of Musical Graphs

A set S of vertices in a graph G = (V, E) 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 Y (G) 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