There are distinct numbers of Sv's, v ∈ V (G), of a graph G of order n, for a 1-2-3-edge labeling and vertex coloring.

Similar questions and discussions