Llwytho...
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...
Wedi'i Gadw mewn:
| Prif Awduron: | , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Taylor & Francis Group
2022-05-01
|
| Cyfres: | AKCE International Journal of Graphs and Combinatorics |
| Pynciau: | |
| Mynediad Ar-lein: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2072789 |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|