1-Restricted Optimal Rubbling on Graphs
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
University of Zielona Góra
2019-05-01
|
| Rangatū: | Discussiones Mathematicae Graph Theory |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.7151/dmgt.2102 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|