| Abstrakt: |
Let G = (V, E) be a graph with vertex set V and edge set E. A proper k − vertex coloring of a graph G = (V, E) is a partition P = {V1,V2, ...Vk} of V into independent set. The graph G is b-coloring if there is a vertex in each color class, which is adjacent to at least one vertex in every other color class. The b-chromatic number of graph G, denoted by ϕ(G), is the largest integer k such that there is a b-coloring with k colors. In this paper, we will study b−coloring of pencil graph Pcn, diamond snake graph Dsn and triangular ladder graph Tln. Furthermore, to see the robust application of b-coloring, at the end of this paper we will illustrate the implementation of it on analyzing the multi-step time series forecasting on soil moisture, temperature and pH of companion farming. [ABSTRACT FROM AUTHOR] |
