Agus, Irawan and Asmiati, Asmiati and Zakaria, L. and Kurnia Muludi, KM (2021) The Locating-Chromatic Number of Origami Graphs. Algorithms, 14 (6). ISSN 1999-4893

Preview

Text algorithms-14-00167-v2_AgusIrawan2021.pdf Download (847kB) | 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 c(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
Depositing User:	Mr Zakaria La
Date Deposited:	08 Jun 2021 01:25
Last Modified:	08 Jun 2021 01:25
URI:	http://repository.lppm.unila.ac.id/id/eprint/32202

Actions (login required)

View Item