바로가기메뉴

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

logo

  • P-ISSN3059-0604
  • E-ISSN3059-1309
  • KCI

ISSN : 3059-0604

논문 상세

이전 다음
논문 투고

Vol.9 No.1

PDF Citation Share

PEBBLING NUMBERS OF THE COMPOSITIONS OF TWO GRAPHS

PEBBLING NUMBERS OF THE COMPOSITIONS OFTWO GRAPHS

한국수학교육학회지시리즈B:순수및응용수학 / Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics, (P)3059-0604; (E)3059-1309
2002, v.9 no.1, pp.57-61
Kim, Ju-Young (Department of Mathematics, Catholic University)
Kim, Sung-Sook (Department of Applied Mathematics, Paichai University)
Kim, Ju-Young, & Kim, Sung-Sook. (2002). PEBBLING NUMBERS OF THE COMPOSITIONS OF TWO GRAPHS, 9(1), 57-61.

Abstract

Let G be a connected graph. A pebbling move on a graph G is the movement of taking two pebbles off from a vertex and placing one of them onto an adjacent vertex. The pebbling number f(G) of a connected graph G is the least n such that any distribution of n pebbles on the vertices of G allows one pebble to be moved to any specified, but arbitrary vertex by a sequence of pebbling moves. In this paper, the pebbling numbers of the compositions of two graphs are computed.

keywords
pebbling, composition product

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

논문 투고 OA 정책