2-Restricted optimal pebbling number
Let G=(V,E) be a simple graph. A pebbling configuration on G is a function f:V→Ν ∪{0} that assigns a non-negative integer number of pebbles to each vertex. The weight of a configuration f is w(f)=∪u∈ V f(u), the total number of pebbles.A pebbling move consists of removing two pebbles from a vertex...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Qom University of Technology
2025-09-01
|
| Edice: | Mathematics and Computational Sciences |
| Témata: | |
| On-line přístup: | https://mcs.qut.ac.ir/article_728796_9d40f8a75cf66d64f591b8a41afaf6bb.pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|