Pebbling graphs
type: Item
instance of: scholarly article
title: Pebbling graphs
zbMATH Open document ID: 0772.05093
DOI: 10.1016/0095-8956(92)90043-W
author: David Moews
published in: Journal of Combinatorial Theory. Series B
publication date: 1993-03-10T00:00:00Z
review text: The pebbling number \(f(G)\) of a graph \(G\) is the least \(n\) such that, however \(n\) pebbles are placed on the vertices of \(G\), we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. Ronald Graham conjectured that for all graphs \(G\) and \(H\), \(f(G\times H)\leq f(G)\cdot f(H)\). This paper proves that this conjecture is true if \(G\) and \(H\) are trees.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 130571
zbMATH Keywords: pebbling graphs
zbMATH Keywords: product digraph
zbMATH Keywords: partition
zbMATH Keywords: pebbling number
zbMATH Keywords: trees
reviewed by: Zhenhong Liu
MaRDI profile type: Publication
cites work: Pebbling in Hypercubes
full work available at URL: 0095-8956(92)90043-w
OpenAlex ID: W2911540966
description: scientific article; zbMATH DE number 130571