http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Procedure for Determining The Locating Chromatic Number of An Origami Graphs
Irawan, Agus,Asmiati, Asmiati,Utami, Bernadhita Herindri Samodra,Nuryaman, Aang,Muludi, Kurnia International Journal of Computer ScienceNetwork S 2022 International journal of computer science and netw Vol.22 No.9
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 χ<sub>L</sub>(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.