ScholarLens Back to search
2019•Communications Faculty Of Science University of Ankara Series A1Mathematics and StatisticsOpen access

On irregular coloring of wheel related graphs

A. Rohini, M. Venkatachalam

Open full text 5 citations

Abstract

An irregular coloring is a proper coloring in which distinct vertices have different color codes. In this paper, we obtain the irregular chromatic number for middle graph, total graph, central graph and line graph of wheel graph, helm graph, gear graph and closed helm graph.

Open-access reader

About this research paper

What this paper is about

An irregular coloring is a proper coloring in which distinct vertices have different color codes. In this paper, we obtain the irregular chromatic number for middle graph, total graph, central graph and line graph of wheel graph, helm graph, gear graph and closed helm graph.

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

An irregular coloring is a proper coloring in which distinct vertices have different color codes. In this paper, we obtain the irregular chromatic number for middle graph, total graph, central graph and line graph of wheel graph, helm graph, gear graph and closed helm graph.

Key concepts: Combinatorics, Graph coloring, Line graph, Mathematics, Fractional coloring, Edge coloring, List coloring, Butterfly graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On irregular coloring of wheel related graphs — Research Paper | ScholarLens