Let G = (V,E) be a graph. A k-color

Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling
f : V (G) → T, where | T |= k and it is proper if the adjacent vertices
have different labels. A graph is k-colorable if it has a proper k-coloring.
The chromatic number χ(G) is the least k such that G is k-colorable.
Here we study chromatic numbers in some kinds of Harary graphs.

ผลลัพธ์ (อังกฤษ) 2:

Let G = (V, E) be a graph. A K-coloring of a graph G is a Labeling
F: V (G) → T, Where | T | = K and it is Proper IF The adjacent vertices
Have different labels. A graph is K-colorable IF it has a Proper K-coloring.
The chromatic number M (G) is The K Such least that G is K-colorable.
Here we Study chromatic numbers in some kinds of Harary Graphs.