The locating chromatic number of (k,n)-split cycle graph and its barbell operation
<p><span>The locating chromatic number remains an active topic in graph theory. It combines the concepts of partition dimension and proper vertex coloring. A necessary condition for determining the locating chromatic number is that each vertex must have a unique color code under a minimal coloring....
Zapisane w:
| Główni autorzy: | , , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2025-10-01
|
| Seria: | Electronic Journal of Graph Theory and Applications |
| Hasła przedmiotowe: | |
| Dostęp online: | http://www.ejgta.org/index.php/ejgta/article/view/1486 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|