Pebbling on the middle graph of a complete binary tree
From MaRDI portal
Publication:5205529
Recommendations
- The 2-pebbling property of the middle graph of fan graphs
- The \(t\)-pebbling number and \(2t\)-pebbling property on the graph \(D_{n,C_{2m}}\).
- The optimal t-pebbling number of a certain complete m-ary tree
- scientific article; zbMATH DE number 7280167
- The \(t\)-pebbling number of the complete graph with a missing edge
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 5542679 (Why is no real title available?)
- scientific article; zbMATH DE number 1145909 (Why is no real title available?)
- On \(t\)-pebbling graphs
- Pebbling in Hypercubes
- The 2-pebbling property of the middle graph of fan graphs
- The \(t\)-pebbling conjecture on products of complete \(r\)-partite graphs.
- \(t\)-pebbling the product of fan graphs and the product of wheel graphs
Cited in
(2)
This page was built for publication: Pebbling on the middle graph of a complete binary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205529)