Fatanur Baity Tsulutsya, Evawati Alisah, Lailiy Kurnia Ilahi
Vertex coloring on a graph G = (V (G), E(G)) giving color for each point on the graph so that there are no two connected directly the same color. A vertex coloring f from graph G is called coloring Backbone-λ of (G,H) if fulfilled |f(υ)-f(ν ≥ λ)|. The smallest number k where there is backbone coloring f: V → {1,2,3,⋯,k} is called several Backbone coloring-λ and denoted byBBC λ (G,H). A graph used in this research is a split graph. This paper presents the process or steps to determine coloring number λ-backbone on a split graph. As for the steps is as follows: determine split graphs, give 1 example of Spanning subgraph (Backbone) containing subgraphs complete maximum of split graphs and contains Hamilton trajectories and give a point coloring on the Hamilton trajectory backbone of the split graph. © 2020 Published under licence by IOP Publishing Ltd.
Engineering Faculty of Trunojoyo University, Jl. Raya Telang PO BOX 2 Kamal, Bangkalan, 69162, Indonesia; Department of Mathematics, Faculty of Sains and Technology, Uin Maulana Malik Ibrahim Malang, Indonesia; Department of English, Faculty of Letters, Universitas Negeri Malang, Indonesia
