On the chromatic number local irregularity of related wheel graph

Arika Indah Kristiana, Moh Imam Utoyo, Dafik, Ika Hesti Agustin, Ridho Alfarisi, Eko Waluyo

Research output: Contribution to journalConference articlepeer-review

8 Citations (Scopus)


A function f is called a local irregularity vertex coloring if (i) as vertex irregular k-labeling and , for every where and (ii) max(l) = min{max{li }; li vertex irregular labeling}. The chromatic number of local irregularity vertex coloring of G, denoted by , is the minimum cardinality of the largest label over all such local irregularity vertex coloring. In this article, we study the local irregularity vertex coloring of related wheel graphs and we have found the exact value of their chromatic number local irregularity, namely web graph, helm graph, close helm graph, gear graph, fan graph, sun let graph, and double wheel graph.

Original languageEnglish
Article number012003
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 7 May 2019
Event2nd International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2018 - Jember, East Java, Indonesia
Duration: 24 Nov 201825 Nov 2018


Dive into the research topics of 'On the chromatic number local irregularity of related wheel graph'. Together they form a unique fingerprint.

Cite this