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)?...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 of some graphs are obtained, and some properties and results are established. Moreover, complete Inj-equitable graph and the Inj-equitable graph are defined.展开更多
文摘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 of some graphs are obtained, and some properties and results are established. Moreover, complete Inj-equitable graph and the Inj-equitable graph are defined.
