Abstract: The principle of domination in graph theory has been applied in various fields, epically in computer science. Several definitions of domination have been presented during last decades. In this research we introduce a new concept of domination in graph G = (V, E) named “total frame domination”. Also, we define the inverse total frame domination. In addition, we determine the total frame domination number and total frame dominating set through this research. Furthermore, we prove some important properties of total frame domination number. Finally, we study the effects of removing vertex or edge from the given graph. According to the result of this research, we conclude that the total frame domination is more effective in real life applications, especially in social media field.