BAREKENG: Jurnal Ilmu Matematika dan Terapan
Vol 19 No 1 (2025): BAREKENG: Journal of Mathematics and Its Application

THE LOCATING CHROMATIC NUMBER OF CHAIN(A,4,n) GRAPH

Welyyanti, Des (Unknown)
Abel, Latifa Azhar (Unknown)
Yulianti, Lyra (Unknown)

Article Info

Publish Date
13 Jan 2025

Abstract

Let be a connected graph with a vertex coloringsuch that two adjacent vertices have different colors. We denote an ordered partition where is a color class with color-, consisting of vertices given color , for . The color code of a vertex in is a -vector: . where is the distance between a vertex in and for . If every two vertices and in have different color codes, , then is called the locating -coloring of . The minimum number of colors k needed in this coloring is defined as the locating chromatic number, denoted by . This paper determines the locating chromatic number of chain graph and the induction of two graphs . Graph is a cyclic graph , which is the identification of , for n>2.

Copyrights © 2025




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
BAREKENG: Jurnal Ilmu Matematika dan Terapan
Website

Abbrev

barekeng

Publisher

Universitas Pattimura

Subject

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

Description

BAREKENG: Jurnal ilmu Matematika dan Terapan is one of the scientific publication media, which publish the article related to the result of research or study in the field of Pure Mathematics and Applied Mathematics. Focus and scope of BAREKENG: Jurnal ilmu Matematika dan Terapan, as follows: - Pure ...