The dominating partition dimension and locating-chromatic number of graphs
<p><span>For every graph </span><span class="math inline"><em>G</em></span><span>, the dominating partition dimension of </span><span class="math inline"><em>G</em></span><span> is either the same as its partition dimension or one higher than its partition dimension. In this paper, we consider some...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2023-10-01
|
| Seri Bilgileri: | Electronic Journal of Graph Theory and Applications |
| Konular: | |
| Online Erişim: | http://www.ejgta.org/index.php/ejgta/article/view/1684 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|