On inclusive distance vertex irregular labelings
<p>For a simple graph <span class="math"><em>G</em></span>, a vertex labeling <span class="math"><em>f</em> : <em>V</em>(<em>G</em>) → {1, 2, ..., <em>k</em>}</span> is called a <span class="math"><em>k</em></span>-labeling. The weight of a vertex <span class="math"><em>v</em></span>, denoted by <sp...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Schriftenreihe: | Electronic Journal of Graph Theory and Applications |
| Schlagworte: | |
| Online-Zugang: | http://www.ejgta.org/index.php/ejgta/article/view/463 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|