on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G)→{1,2,…,k-1} defined c'(uv)=|c(u)-c(v)...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2022-10-01
|
| Series: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Subjects: | |
| Online Access: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/16334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|