- P-ISSN3059-0604
- E-ISSN3059-1309
- KCI
ISSN : 3059-0604
논문 상세
- 2025 (32권)
- 2024 (31권)
- 2023 (30권)
- 2022 (29권)
- 2021 (28권)
- 2020 (27권)
- 2019 (26권)
- 2018 (25권)
- 2017 (24권)
- 2016 (23권)
- 2015 (22권)
- 2014 (21권)
- 2013 (20권)
- 2012 (19권)
- 2011 (18권)
- 2010 (17권)
- 2009 (16권)
- 2008 (15권)
- 2007 (14권)
- 2006 (13권)
- 2005 (12권)
- 2004 (11권)
- 2003 (10권)
- 2002 (9권)
- 2001 (8권)
- 2000 (7권)
- 1999 (6권)
- 1998 (5권)
- 1997 (4권)
- 1996 (3권)
- 1995 (2권)
- 1994 (1권)
COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS
COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS
한국수학교육학회지시리즈B:순수및응용수학 / Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics, (P)3059-0604; (E)3059-1309
2008, v.15 no.2, pp.121-134
Lourdusamy, A.
(DEPARTMENT OF MATHEMATICS, ST. XAVIER'S COLLEGE (AUTONOMOUS))
Tharani, A. Punitha (DEPARTMENT OF MATHEMATICS, ST. MARY'S COLLEGE)
Tharani, A. Punitha (DEPARTMENT OF MATHEMATICS, ST. MARY'S COLLEGE)
Lourdusamy, A.,
&
Tharani, A. Punitha.
(2008). COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS. , 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