The Pure and Applied Mathematics (한국수학교육학회지시리즈B:순수및응용수학)
- Volume 15 Issue 2
- /
- Pages.121-134
- /
- 2008
- /
- 1226-0657(pISSN)
- /
- 2287-6081(eISSN)
COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS
- Lourdusamy, A. (DEPARTMENT OF MATHEMATICS, ST. XAVIER'S COLLEGE (AUTONOMOUS)) ;
- Tharani, A. Punitha (DEPARTMENT OF MATHEMATICS, ST. MARY'S COLLEGE)
- Published : 2008.05.31
Abstract
A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The covering cover pebbling number of a graph is the smallest number of pebbles, such that, however the pebbles are initially placed on the vertices of the graph, after a sequence of pebbling moves, the set of vertices with pebbles forms a covering of G. In this paper we find the covering cover pebbling number of n-cube and diameter two graphs. Finally we give an upperbound for the covering cover pebbling number of graphs of diameter d.