Abstract: Through this research, a new concept of domination in Graph G = (V, E) named “frame domination” has been defined. The inverse frame domination and connected frame domination have been addressed. This study presents some properties (related to the frame dominating set and frame domination number) which show the concepts of connected and inverse frame domination. Furthermore, some bounds of frame, connected and inverse frame domination are determined. Specifically, the affection of frame domination parameter when a graph is modified by deleting or adding or contracting an edge or deleting a vertex studied deeply through the literature of this study.