Pebbling Graphs of Fixed Diameter

DOI10.1002/jgt.21736zbMath1292.05210OpenAlexW1960488935MaRDI QIDQ5417824

Luke Postle

Publication date: 22 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.6837

zbMATH Keywords

dominating setsgraph pebbling

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Modified linear programming and class 0 bounds for graph pebbling

Cites Work

• An addition theorem on the integers modulo \(n\)
• On a conjecture of Kleitman and Lemke
• Improved pebbling bounds
• On Pebbling Graphs by Their Blocks
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths
• Pebbling Graphs of Diameter Three and Four
• Maximum pebbling number of graphs of diameter three
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pebbling Graphs of Fixed Diameter