Muludi, Kurnia and Irawan, Agus and Zakaria, L and Asmiati, Asmiati repo jurnal : The Locating-Chromatic Number of Origami Graphs. algorithm.
|
Text
repo jurnal algorithm 2021.pdf Download (1MB) | Preview |
Abstract
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by cL(G). This article proposes a procedure for obtaining a locating-chromatic number for an origami graph and its subdivision (one vertex on an outer edge) through two theorems with proofs.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Depositing User: | Kurnia Muludi |
| Date Deposited: | 21 Feb 2022 02:21 |
| Last Modified: | 21 Feb 2022 02:21 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/39651 |
Actions (login required)
 |
View Item |