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...
Kaydedildi:
| Asıl Yazarlar: | , , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2023-05-01
|
| Seri Bilgileri: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Konular: | |
| Online Erişim: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/16917 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|