상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
학술저널

THE DOMINATION COVER PEBBLING NUMBER OF SOME GRAPHS

  • 0
136704.jpg

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. The domination cover pebbling number ψ(G) is the minimum number of pebbles required so that any initial configuration of pebbles can be transformed by a sequence of pebbling moves so that the set of vertices that contain pebbles forms a domination set of G. We determine the domination cover pebbling number for fans, fuses, and pseudo-star.

1. Introduction

2. Domination Cover Pebbling for Fans

3. Domination Cover Pebbling for fuses

(0)

(0)

로딩중