載入...
Monophonic pebbling number and t-pebbling number of some graphs
Assume G is a graph with some pebbles distributed over its vertices. A pebbling move is when two pebbles are removed from one vertex, one is thrown away, and the other is moved to an adjacent vertex. The monophonic pebbling number, [Formula: see text] of a connected graph G, is the least positive in...
Na minha lista:
| Main Authors: | , , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Taylor & Francis Group
2022-05-01
|
| 叢編: | AKCE International Journal of Graphs and Combinatorics |
| 主題: | |
| 在線閱讀: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2072789 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|