Ara
Toplam kayıt 1, listelenen: 1-1
On equitable chromatic number of Tadpole graph T_{m,n}
(Ankara Üniversitesi Fen Fakültesi, 2019-08-01)
Graph coloring is a special case of graph labeling. Proper vertex k-coloring of a graph Gis to color all the vertices of a graph with different colors in such a way that no two adjacent vertices are assigned with the same ...