Trees with Certain Locating-chromatic Number

Journal Title: Journal of Mathematical and Fundamental Sciences - Year 2016, Vol 48, Issue 1

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.

Authors and Affiliations

Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun

Keywords

Related Articles

Study on Estimates of Travel Distance, Velocity and Potential Volume of Amahusu Sliding Plane using Energy Conservation Approach in Conjunction with Geoelectric Survey

The investigation of landslides applying various methods has been receiving increased attention in recent years. This study was aimed at assessing the estimated distribution of landslide movement using an energy conserva...

Novel Ternary CoFe2O4/CuO/CoFe2O4 as a Giant Magnetoresistance Sensor

This paper reports the results of a study relating to the synthesis of a novel ternary CoFe2O4/CuO/CoFe2O4 thin film as a giant magnetoresistance (GMR) sensor. The CoFe2O4/CuO/CoFe2O4 thin film was prepared onto silicon...

Introduction of Interpolation and Extrapolation Model in Lanczos-type Algorithms A13/B6 and A13/B13 to Enhance their Stability

A new method to treat the inherent instability of Lanczos-type algorithms is introduced. It enables us to capture the properties of the sequence of iterates generated by a Lanczos-type algorithm by interpolating on this...

On a Certain Subclass of Meromorphic Functions Defined by a New Linear Differential Operator

In this article, a new linear differential operator I^k (L_s^a (a_l,b_m )f(z)) is defined by using the Hadamard product of the q-hypergeometric function and a function related to the Hurwitz-Lerch zeta function. By using...

Stability in Functional Integro-differential Equations of Second Order with Variable Delay

In this paper, we investigate the stability of the zero solution of an integro-differential equation of the second order with variable delay. By means of the fixed point theory and an exponential weighted metric, we find...

Download PDF file
  • EP ID EP203102
  • DOI 10.5614/j.math.fund.sci.2016.48.1.4
  • Views 141
  • Downloads 0

How To Cite

Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun (2016). Trees with Certain Locating-chromatic Number. Journal of Mathematical and Fundamental Sciences, 48(1), 39-47. https://europub.co.uk/articles/-A-203102