Optimal L(3,2,1)-labeling of trees
Given a graph G, an [Formula: see text]-labeling of G is an assignment f of non-negative integers (labels) to the vertices of G such that [Formula: see text] if [Formula: see text] (i = 1, 2, 3). For a non-negative integer k, a k-[Formula: see text]-labeling is an [Formula: see text]-labeling such t...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Taylor & Francis Group
2024-09-01
|
| 叢編: | AKCE International Journal of Graphs and Combinatorics |
| 主題: | |
| 在線閱讀: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2358691 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|