On the locating chromatic number of certain barbell graphs
type: Item
instance of: scholarly article
title: On the locating chromatic number of certain barbell graphs
zbMATH Open document ID: 1486.05069
DOI: 10.1155/2018/5327504
author: Asmiati
author: I. Ketut Sadha Gunce Yana
author: L. Yulianti
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 2019-02-27T00:00:00Z
review text: Summary: The locating chromatic number of a graph \(G\) is defined as the cardinality of a minimum resolving partition of the vertex set \(V(G)\) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in \(G\) are not contained in the same partition class. In this case, the coordinate of a vertex \(v\) in \(G\) is expressed in terms of the distances of \(v\) to all partition classes. This concept is a special case of the graph partition dimension notion. In this paper we investigate the locating chromatic number for two families of barbell graphs.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7029958
zbMATH Keywords: chromatic number of a graph
zbMATH Keywords: partition classes
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/5327504
OpenAlex ID: W2886483931
cites work: Q4489210
cites work: Conditional resolvability in graphs: a survey
cites work: Structure-activity maps for visualizing the graph variables arising in drug design
cites work: Q4464781
cites work: Q4794375
cites work: Graphs of order \(n\) with locating-chromatic number \(n-1\)
cites work: On the locating chromatic number of Kneser graphs
cites work: ON SOME PETERSEN GRAPHS HAVING LOCATING CHROMATIC NUMBER FOUR OR FIVE
cites work: Characterizing all trees with locating-chromatic number 3
cites work: Q4648329
cites work: On locating-chromatic number of complete \(n\)-ary tree
cites work: A theorem on tait colorings with an application to the generalized Petersen graphs
description: scientific article; zbMATH DE number 7029958