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...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Taylor & Francis Group
2022-05-01
|
| Edice: | AKCE International Journal of Graphs and Combinatorics |
| Témata: | |
| On-line přístup: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2072789 |