RADIO LABELING OF BANANA GRAPHS
Let G=(V, E) be a graph. An L(3,2,1) labeling of G is a function such that for every , , and if . Let , a labeling is a labeling where all labels are not greater than . An ) number of , denoted by , is the smallest non-negative integer such that has a labeling. In this paper, w...
Tallennettuna:
| Päätekijät: | , , , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Universitas Pattimura
2023-04-01
|
| Sarja: | Barekeng |
| Aiheet: | |
| Linkit: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6794 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|