Optimal t-pebbling on paths and cycles

DOI10.3969/J.ISSN.0253-2778.2015.03.002MaRDI QIDQ3462997zbMATH OpenFDO

Authors Zheng-Jiang Xia, Yongliang Pan, Jun-Ming Xu

Publication date 15 January 2016

zbMATH Keywords

cycleCartesian productpathoptimal \(t\)-pebbling number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• The optimal pebbling number of square of paths and cycles.
• Optimally \(t\)-pebbling graphs
• Optimal \(t\)-pebbling in cycles
• Optimal pebbling of graphs
• The \(t\)-pebbling number of squares of cycles

Cited in

(10)

• The optimal t-pebbling number of a certain complete m-ary tree
• The optimal pebbling of spindle graphs
• The optimal pebbling number of square of paths and cycles.
• An improved upper bound for the pebbling threshold of the \(n\)-path
• The optimal pebbling number of the complete \(m\)-ary tree
• Optimal \(t\)-pebbling in cycles
• Distance restricted optimal pebbling in paths
• Optimally \(t\)-pebbling graphs
• Optimal t-rubbling on complete graphs and paths
• The optimal pebbling number of the caterpillar

This page was built for publication: Optimal \(t\)-pebbling on paths and cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462997)