The t-pebbling number and 2t-pebbling property on the graph D_n,C₂m.

MaRDI QIDQ2804798zbMATH OpenFDO

Authors Zhiping Wang, Xu Han

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

pebbling\(t\)-pebbling number\(2t\)-pebbling property

Mathematics Subject Classification ID

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

Recommendations

• Pebbling number of the graph \(D_{n,C_m}\).
• \(t\)-pebbling the graphs of diameter two
• \(t\)-pebbling number in graphs
• On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs
• scientific article; zbMATH DE number 7280167

Cited in

(9)

• Pebbling number of the graph \(D_{n,C_m}\).
• \(t\)-pebbling number in graphs
• Pebbling on the middle graph of a complete binary tree
• \(t\)-pebbling in \(k\)-connected graphs with a universal vertex
• 2-pebbling property of butterfly-derived graphs
• On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs
• \(t\)-pebbling the graphs of diameter two
• The \(t\)-pebbling number of the complete graph with a missing edge
• The \(t\)-pebbling number of Lamp graphs

This page was built for publication: The \(t\)-pebbling number and \(2t\)-pebbling property on the graph \(D_{n,C_{2m}}\).

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