Distance pebbling on directed cycle graphs

MaRDI QIDQ5133072zbMATH OpenFDO

Authors Michael P. Knapp

Publication date 12 November 2020

zbMATH Keywords

graph pebblingpebbling number

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Distance restricted optimal pebbling in cycles
• Equality of pebbling numbers on directed graphs
• Pebbling number of squares of odd cycles
• Maximum pebbling number of graphs of diameter three
• Pebbling number of the graph \(D_{n,C_m}\).

Cited in

(5)

• 2-adic zeros of diagonal forms
• Distance restricted optimal pebbling in cycles
• Equality of pebbling numbers on directed graphs
• On the target pebbling conjecture
• On the secure vertex cover pebbling number

This page was built for publication: Distance pebbling on directed cycle graphs

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