Domination Cover Pebbling: Graph Families

Details Domination Cover Pebbling: Graph Families Domination Cover Pebbling: Graph Families

2005-07-13

arxiv.org/abs/math/0507271v1

Mathematics

Combinatorics

18 pages

Scientific paper

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of domination cover pebbling, obtained by combining graph cover pebbling with the theory of domination in graphs. The domination cover pebbling number, psi(G), of a graph G is the minimum number of pebbles that must be placed on V(G) such that after a sequence of pebbling moves, the set of vertices with pebbles forms a dominating set of G, regardless of the initial configuration of pebbles. We discuss basic results and determine psi(G) for paths, cycles and complete binary trees.

Affiliated with

Also associated with

No associations

Rating

Domination Cover Pebbling: Graph Families 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 Domination Cover Pebbling: Graph Families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination Cover Pebbling: Graph Families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295292