The Locating Chromatic Number for Amalgamation of Some Complete Graphs
The locating chromatic number of a graph is a combination of partition dimension and vertex coloring, where every two adjacent vertices are in different color classes, and all vertices have a unique color code. The amalgamation of a ≥ 2 complete graphs (K_n, n≥ 3) denoted by aK_n is obtained by ide...
Sparad:
| Huvudupphov: | , , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
UIN Syarif Hidayatullah
2024-05-01
|
| Serie: | InPrime |
| Ämnen: | |
| Länkar: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/38711 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|