39 citations · 40 across the 8 of their papers we have counts for
1 paper · 1 filter
Akbar Davoodi, Behnaz Omoomi
A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weight…