Cover pebbling cycles and certain graph products

Details Cover pebbling cycles and certain graph products Cover pebbling cycles and certain graph products

2004-10-01

arxiv.org/abs/math/0410030v1

Mathematics

Combinatorics

10 pages

Scientific paper

A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number of a graph is the minimum number of pebbles such that the graph can be cover pebbled, no matter how the pebbles are initially placed on the vertices of the graph. In this paper we determine the cover pebbling numbers of cycles, finite products of paths and cycles, and products of a path or a cycle with good graphs, amongst which are trees and complete graphs. In the process we provide evidence in support of an affirmative answer to a question posed in a paper by Cundiff, Crull, et al.

Affiliated with

Also associated with

No associations

Rating

Cover pebbling cycles and certain graph products does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cover pebbling cycles and certain graph products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cover pebbling cycles and certain graph products will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-351692