irawan, agus and asmiati, asmiati and zakaria, la and Muludi, Kurnia (2021) The Locating-Chromatic Number of Origami Graphs. Algorithms. ISSN 1999-4893

[img] Text
algorithms-14-00167-v2.pdf

Download (848kB)

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 > QA75 Electronic computers. Computer science
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User: Kurnia Muludi
Date Deposited: 04 Nov 2021 01:13
Last Modified: 04 Nov 2021 01:13
URI: http://repository.lppm.unila.ac.id/id/eprint/34960

Actions (login required)

View Item View Item