바로가기메뉴

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

ACOMS+ 및 학술지 리포지터리 설명회

  • 한국과학기술정보연구원(KISTI) 서울분원 대회의실(별관 3층)
  • 2024년 07월 03일(수) 13:30
사전등록 바로가기
 

logo

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

ISSN : 1226-0657

논문 상세

이전 다음
논문 투고

Vol.15 No.2

Citation Share

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: The Pure and Applied Mathematics, (P)1226-0657; (E)2287-6081
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)
Lourdusamy, A., & Tharani, A. Punitha. (2008). COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS. 한국수학교육학회지시리즈B:순수및응용수학, 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

한국수학교육학회지시리즈B:순수및응용수학

논문 투고 OA 정책