To search, Click below search items.

 

All Published Papers Search Service

Title

A Procedure for Determining The Locating Chromatic Number of An Origami Graphs

Author

Agus Irawan, Asmiati, Bernadhita Herindri Samodra Utami, Aang Nuryaman, and Kurnia Muludi

Citation

Vol. 22  No. 9  pp. 31-34

Abstract

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.

Keywords

locating-chromatic number, graph, origami, python.

URL

http://paper.ijcsns.org/07_book/202209/20220905.pdf