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....
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2025-10-01
|
| Sarja: | Electronic Journal of Graph Theory and Applications |
| Aiheet: | |
| Linkit: | http://www.ejgta.org/index.php/ejgta/article/view/1486 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|