On the Locating Chromatic Number of Certain Barbell Graphs

Asmiati, I. Ketut Sadha Gunce Yana and Lyra Yulianti

International Journal of Mathematics and Mathematical Sciences, 2018, vol. 2018, 1-5

Abstract:

The locating chromatic number of a graph is defined as the cardinality of a minimum resolving partition of the vertex set such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in are not contained in the same partition class. In this case, the coordinate of a vertex in is expressed in terms of the distances of 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.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2018/5327504.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2018/5327504.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:5327504

DOI: 10.1155/2018/5327504

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().