A note on vertex irregular total labeling of trees
The total vertex irregularity strength of a graph <em>G=</em>(<em>V,E</em>) is the minimum integer <em>k</em> so that there is a mapping from <em>V ∪ E</em> to the set {<em>1,2,...,k</em>} so that the vertex-weights (i.e., the sum of labels of a vertex together with the edges incident to it) are all...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2023-07-01
|
| Edice: | Indonesian Journal of Combinatorics |
| Témata: | |
| On-line přístup: | http://www.ijc.or.id/index.php/ijc/article/view/189 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|