Equal Degree Graphs of Simple Graphs

This paper introduces equal degree graphs of simple existed graphs. These graphs exhibited some properties which are co-related with the older one. We characterize graphs for which their equal degree graphs are connected, completed, disconnected but not totally disconnected. We also obtain several properties of equal degree graphs and specify which graphs are isomorphic to equal degree graphs and complement of equal degree graphs. Furthermore, the relation between equal degree graphs and degree Prime graphs is determined.