On Irregular Colorings of Unicyclic Graph Family
Irregular coloring is a proper coloring and each vertex on a graph must have a different code. The color code of a vertex v is where and is the number of vertices that are adjacent to v and colored i. The minimum k-color used in irregular coloring is called the irregular chromatic number and de...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2023-05-01
|
| Series: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Subjects: | |
| Online Access: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/16917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Irregular coloring is a proper coloring and each vertex on a graph must have a different code. The color code of a vertex v is where and is the number of vertices that are adjacent to v and colored i. The minimum k-color used in irregular coloring is called the irregular chromatic number and denoted by . In this paper, we discuss the irregular chromatic number for the bull graph, pan graph, sun graph, peach graph, and caveman graph. |
|---|---|
| ISSN: | 2086-0382 2477-3344 |