Coprime Irregular graphs
S. Saravanakumar · International Journal of Engineering and Advanced Technology · 2019
An l-edge-weighting of a graph G is a map : E(G) {1, 2, 3, … l}, where l is a positive integer. For a vertex v V(G), the weight (v) is the sum of edge-weights appearing on the edges incident at v under the edge-weighting . An l-edge-weighting of G is coprime irregular edge-weighting of G if gcd( (u), (v)) = 1 for every pair of adjacent vertices u and v in G. A graph G is coprime irregular if G admits a coprime irregular edge-weighting. In this paper, we discuss this new irregular edge weighting of graphs.