论文部分内容阅读
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 IE (G), ≤ 1, where for any vertex w∈V (G) , degin (w)?= . In this paper, Inj-equitable graphs