ScholarLens Back to search
2019•Journal of Physics Conference SeriesOpen access

The locating chromatic number of disconnected graph with path and cycle graph as its components

Des Welyyanti, Riri Lestari, Suci Rahma Putri

Open full text 5 citations

Abstract

A special case of the graph partition dimension is The locating-chromatic number of a graph. In 2002, The concept of locating-chromatic number of a connected graph was introduced by Chartrand et al.. In 2014, definition locating-chromatic number for a disconnected graph is extended by Welyyanti et al. As a continuation, we determine the locating-chromatic number of some disconnected graphs with path and cycle as its components.

Open-access reader

About this research paper

What this paper is about

A special case of the graph partition dimension is The locating-chromatic number of a graph. In 2002, The concept of locating-chromatic number of a connected graph was introduced by Chartrand et al.. In 2014, definition locating-chromatic number for a disconnected graph is extended by Welyyanti et al. As a continuation, we determine the locating-chromatic number of some disconnected graphs with path and cycle as its components.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A special case of the graph partition dimension is The locating-chromatic number of a graph. In 2002, The concept of locating-chromatic number of a connected graph was introduced by Chartrand et al.. In 2014, definition locating-chromatic number for a disconnected graph is extended by Welyyanti et al. As a continuation, we determine the locating-chromatic number of some disconnected graphs with path and cycle as its components.

Key concepts: Butterfly graph, Windmill graph, Chromatic scale, Critical graph, Friendship graph, Combinatorics, Mathematics, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The locating chromatic number of disconnected graph with path and cycle graph as its components — Research Paper | ScholarLens