Graph pegging numbers

DOI10.1016/j.disc.2008.03.029zbMath1228.05244arXiv0804.1095OpenAlexW2002719232MaRDI QIDQ1025451

David Petrie Moulton, Philip Matchett Wood, Madeeha Khalid, Geir T. Helleloid

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.1095

zbMATH Keywords

pebbling numbergraph pebblinggraph peggingpegging number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (1)

Threshold and complexity results for the cover pebbling game

Cites Work

• Unnamed Item
• Unnamed Item
• Optimally pebbling hypercubes and powers
• Diagonal checker-jumping and Eulerian numbers for color-signed permutations
• Pegging Numbers For Various Tree Graphs
• On Moore Graphs with Diameters 2 and 3
• A nonconstructive upper bound on covering radius
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths

This page was built for publication: Graph pegging numbers