期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2018
卷号：2018
DOI：10.1155/2018/5327504
出版社：Hindawi Publishing Corporation
摘要：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.
