2004/09/20 by Glenn Hurlbert, Glenn H. Hurlbert, Hurlbert, Glenn H. +2 · 1 citation
Computer Science · Mathematics · #05C35 #05C99 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #Limits and Structures in Graph Theory #math.CO #msc:05C35 #msc:05C99
paper · pdf · doi:10.48550/arxiv.math/0409368
11 pages
arxiv created 2004/09/20 · openalex publication_date 2004/09/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step removes two pebbles from one vertex and places one pebble on an adjacent vertex. The cover pebbling number g=g(G) is the minimum number so that every configuration of g pebbles has the property that, after some sequence of pebbling steps, every vertex has a pebble on it. We prove that the cover pebbling number of the d-dimensional hypercube Qd equals 3d.