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
Growth Rates Analysis of Porites Corals from Nusa Penida, Bali
The annual growth of Porites coral is represented by a pair of high- and low-density bands. Environmental changes in the ambient waters influence the pattern of these annual density bands. Five colonies of Porites corals...
New Seven-Step Numerical Method for Direct Solution of Fourth Order Ordinary Differential Equations
A new numerical method for solving fourth order ordinary differential equations directly is proposed in this paper. Interpolation and collocation were employed in developing this method using seven steps. The use of the...
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...
C-Γ-hyperideal Theory in Ordered Γ-semihypergroups
Our purpose in this article is to characterize the properties of C-Γ-hyperideals in ordered Γ-semihypergroups. As an application of the results of this paper, the corresponding results of ordered semihypergroups can also...
An Elementary Approach to Polynomial Optimization on Polynomial Meshes
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree. We apply the recently developed theory of polynomial meshe...