On the Locating Chromatic Number of Certain Barbell Graphs
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2018-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2018/5327504 |
| id |
doaj-3d048fb1b07b4a05a21dfd52b630dfd5 |
|---|---|
| record_format |
Article |
| spelling |
doaj-3d048fb1b07b4a05a21dfd52b630dfd52020-11-25T01:03:33ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252018-01-01201810.1155/2018/53275045327504On the Locating Chromatic Number of Certain Barbell GraphsAsmiati0I. Ketut Sadha Gunce Yana1Lyra Yulianti2Mathematics Department, Faculty of Mathematics and Natural Sciences, Lampung University, Jl. Brodjonegoro No.1 Bandar Lampung, IndonesiaMathematics Department, Faculty of Mathematics and Natural Sciences, Lampung University, Jl. Brodjonegoro No.1 Bandar Lampung, IndonesiaMathematics Department, Faculty of Mathematics and Natural Sciences, Andalas University, Kampus UNAND Limau Manis, Padang 25163, IndonesiaThe 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.http://dx.doi.org/10.1155/2018/5327504 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Asmiati I. Ketut Sadha Gunce Yana Lyra Yulianti |
| spellingShingle |
Asmiati I. Ketut Sadha Gunce Yana Lyra Yulianti On the Locating Chromatic Number of Certain Barbell Graphs International Journal of Mathematics and Mathematical Sciences |
| author_facet |
Asmiati I. Ketut Sadha Gunce Yana Lyra Yulianti |
| author_sort |
Asmiati |
| title |
On the Locating Chromatic Number of Certain Barbell Graphs |
| title_short |
On the Locating Chromatic Number of Certain Barbell Graphs |
| title_full |
On the Locating Chromatic Number of Certain Barbell Graphs |
| title_fullStr |
On the Locating Chromatic Number of Certain Barbell Graphs |
| title_full_unstemmed |
On the Locating Chromatic Number of Certain Barbell Graphs |
| title_sort |
on the locating chromatic number of certain barbell graphs |
| publisher |
Hindawi Limited |
| series |
International Journal of Mathematics and Mathematical Sciences |
| issn |
0161-1712 1687-0425 |
| publishDate |
2018-01-01 |
| description |
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. |
| url |
http://dx.doi.org/10.1155/2018/5327504 |
| work_keys_str_mv |
AT asmiati onthelocatingchromaticnumberofcertainbarbellgraphs AT iketutsadhagunceyana onthelocatingchromaticnumberofcertainbarbellgraphs AT lyrayulianti onthelocatingchromaticnumberofcertainbarbellgraphs |
| _version_ |
1725200684528173056 |