Domination cover rubbling
From MaRDI portal
Publication:1741498
DOI10.1016/j.dam.2019.01.037zbMath1409.05145OpenAlexW2917210174MaRDI QIDQ1741498
Teresa W. Haynes, Robert A. Beeler, Rodney Keaton
Publication date: 3 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.037
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (4)
Optimal t-rubbling on complete graphs and paths ⋮ Strict optimal rubbling of graphs ⋮ Total domination cover rubbling ⋮ Cover rubbling and stacking
Cites Work
- The optimal rubbling number of ladders, prisms and Möbius-ladders
- Rubbling and optimal rubbling of graphs
- Bounds on the rubbling and optimal rubbling numbers of graphs
- The cover pebbling number of graphs
- The cover pebbling theorem
- Pebbling in Hypercubes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domination cover rubbling