The Locating-Chromatic Number of Origami Graphs

The Locating-Chromatic Number of Origami Graphs

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 <i>k</i> such that <i>G</i> has a locating <i>k</i>-coloring, denoted by <inline-for...

Full description

Bibliographic Details
Main Authors: Agus Irawan, Asmiati Asmiati, La Zakaria, Kurnia Muludi
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Algorithms
Subjects:
locating-chromatic number
origami graphs
subdivision
Online Access:https://www.mdpi.com/1999-4893/14/6/167

Internet

https://www.mdpi.com/1999-4893/14/6/167

Similar Items