• International Journal of Computer Science & Network Security
• /
• 제21권9호
• /
• pp.79-85
• /
• 2021

The locating-chromatic number denote by 𝛘_𝐿(G), is the smallest t such that G has a locating t-coloring. In this research, we determined locating-chromatic number for subdivision of certain barbell operation of origami graphs.

• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.31-34
• /
• 2022

The concept of locating chromatic number of graph is a development of the concept of vertex coloring and partition dimension of graph. The locating-chromatic number of G, denoted by χ_L(G) is the smallest number such that G has a locating k-coloring. In this paper we will discussed about the procedure for determine the locating chromatic number of Origami graph using Python Programming.