The Italian bondage and reinforcement numbers of digraphs
<span>An </span><span class="math">Italian dominating function</span><span> on a digraph </span><span class="math">D</span><span> with vertex set </span><span class="math">V(D)</span><span> is defined as a function </span><span class="math">f : V(D) → {0, 1, 2}</span><span> such that every vertex </...
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2025-10-01
|
| Цуврал: | Electronic Journal of Graph Theory and Applications |
| Нөхцлүүд: | |
| Онлайн хандалт: | http://www.ejgta.org/index.php/ejgta/article/view/1213 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|
