The Locating Chromatic Number of Zigzag Graph Z_n
The locating chromatic number is a concept developed from vertex coloring and the partition dimension of a graph, first studied by Chartrand et al. (2002). A connected graph G is said to have a locating coloring when each vertex is assigned a color such that the resulting color code defined by its...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
UIN Syarif Hidayatullah
2025-11-01
|
| Ráidu: | InPrime |
| Fáttát: | |
| Liŋkkat: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/46443 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|