A Study on Radio Labeling of Diameter N-2 and Caterpillar Graphs
M. Shakila, N. Rajakumari · International Journal of Emerging Research in Management and Technology · 2018
Radio labeling of graphs is a specific type of graph labeling. The basic type of graph labeling is vertex coloring; this is where the vertices of a graph G are assigned different colors so that adjacent vertices are not given the same color. A k-coloring of a graph G is a coloring that uses k colors. The chromatic number of a graph G is the minimum value for k such that a k-coloring exists for G [2].