Strict optimal rubbling of graphs
From MaRDI portal
Publication:6064866
DOI10.1016/j.dam.2023.04.018zbMath1528.05048OpenAlexW4385540454MaRDI QIDQ6064866
Publication date: 11 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.04.018
Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- The optimal rubbling number of ladders, prisms and Möbius-ladders
- Rubbling and optimal rubbling of graphs
- Pebbling graphs
- The 2-pebbling property and a conjecture of Graham's
- Optimally pebbling hypercubes and powers
- Graham's pebbling conjecture on product of complete bipartite graphs
- Domination cover rubbling
- Pebbling and Graham's conjecture
- Optimal pebbling and rubbling of graphs with given diameter
- Total domination cover rubbling
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Pebbling in Hypercubes
- Graham's pebbling conjecture on products of cycles
- Pebbling and optimal pebbling in graphs
This page was built for publication: Strict optimal rubbling of graphs
