The Locating-Chromatic Number of Origami Graphs-Reference-Cited by-同舟云学术

The Locating-Chromatic Number of Origami Graphs

Published:2021-05-27 Issue:6 Volume:14 Page:167
ISSN:1999-4893
Container-title:Algorithms
language:en
Short-container-title:Algorithms

Author:

Irawan Agus,Asmiati Asmiati,Zakaria La^ORCID,Muludi Kurnia

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 χL(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.

Publisher

MDPI AG

Subject

Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science

Link

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

Reference23 articles.

1. The partition dimension of a graph

2. The partition dimension of a graph

3. Landmarks in graphs

4. Conditional resolvability in graphs: a survey

5. Structure-activity maps for visualizing the graph variables arising in drug design

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Edge-locating coloring of graphs;Electronic Journal of Graph Theory and Applications;2024-04-20

2. The upper bound of locating chromatic number of sun graphs;AIP Conference Proceedings;2024

3. The locating chromatic number for m-shadow of a connected graph;Electronic Journal of Graph Theory and Applications;2022-10-29

4. A Procedure for Determining The Locating Chromatic Number of An Origami Graphs;INT J COMPUT SCI NET;2022

5. Subdivision of Certain Barbell Operation of Origami Graphs has Locating-Chromatic Number Five;INT J COMPUT SCI NET;2021