A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
For any graph G, the Inj-equitable graph of a graph G, denoted by ( ) IE G , is the graph with the same vertices as G and for any two adjacent vertices u and v in . In this paper, Inj-equitable graphs of some graphs are obtained, and some properties and results are established. Moreover, complete Inj-equitable graph and the Inj-equitable graph are defined.doi:10.4236/am.2018.93020 fatcat:62jyxuqsfbc5tpjrnxlcxkuwvm