Optimal t-rubbling on complete graphs and paths
From MaRDI portal
Publication:6063837
DOI10.47443/dml.2023.089OpenAlexW4383067301MaRDI QIDQ6063837
Publication date: 12 December 2023
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2023.089
Extremal problems in graph theory (05C35) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- The optimal rubbling number of ladders, prisms and Möbius-ladders
- \(t\)-pebbling and extensions
- The \(t\)-pebbling number of \(C_5\square C_5\)
- Rubbling and optimal rubbling of graphs
- 1-restricted optimal rubbling on graphs
- Domination cover rubbling
- Optimal pebbling and rubbling of graphs with given diameter
- Bounds on the rubbling and optimal rubbling numbers of graphs
- The \(t\)-pebbling number of graphs
- Optimal Pebbling in Products of Graphs
- On Pebbling Graphs by Their Blocks
- Pebbling and optimal pebbling in graphs
- The Complexity of Graph Pebbling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item