Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Journal of Mathematical and Fundamental Sciences
Dian Kastika Syofyan
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung 40132, Indonesia.
Astronomy Chemistry Earth & Planetary Sciences Mathematics Physics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Trees with Certain Locating-chromatic Number Dian Kastika Syofyan; Edy Tri Baskoro; Hilda Assiyatun
Journal of Mathematical and Fundamental Sciences Vol. 48 No. 1 (2016)
Publisher : Institute for Research and Community Services (LPPM) ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/j.math.fund.sci.2016.48.1.4

Abstract

The locating-chromatic number of a graph G can be 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. Previous authors have characterized all graphs of order n with locating-chromatic number either n or n-1. They also proved that there exists a tree of order n, n≥5, having locating-chromatic number k if and only if k âˆˆ{3,4,"¦,n-2,n}. In this paper, we characterize all trees of order n with locating-chromatic number n - t, for any integers n and t, where n > t+3 and 2 ≤ t < n/2.
Co-Authors Edy Tri Baskoro Hilda Assiyatun