바로가기메뉴

본문 바로가기 주메뉴 바로가기

logo

  • P-ISSN1226-0657
  • E-ISSN2287-6081
  • KCI

ISSN : 1226-0657

Article Contents

Prev Next
e-Submission

Vol.15 No.2

Citation Share

COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS

Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics / Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, (P)1226-0657; (E)2287-6081
2008, v.15 no.2, pp.121-134
Lourdusamy, A.
Tharani, A. Punitha
Lourdusamy,, A. , & Tharani,, A. P. (2008). COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS. Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, 15(2), 121-134.

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.

keywords
graph pebbling, covering, covering cover pebbling

Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics

e-Submission OA Policy