Optimally t-Pebbling Graphs
博士 === 中原大學 === 應用數學研究所 === 106 === Let $G$ be a simple graph. A distribution $delta$ of $G$ is a mapping from $V(G)$ into the set of non-negative integers, where $delta(v)$ is the number of pebbles distributed to the vertex $v$ for each $vin V(G)$. A {it pebbling move} consists of removing two peb...
Main Authors: | Hung-Hsing Chiang, 姜宏興 |
---|---|
Other Authors: | Mu-Ming Wong |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/3tnr33 |
Similar Items
-
Optimally Pebbling Graphs
by: Chin-Lin Shiue, et al. -
The optimal pebbling of spindle graphs
by: Gao Ze-Tu, et al.
Published: (2019-11-01) -
A Study on the Optimal Pebbling of Graphs
by: 吳柏翰
Published: (2013) -
Optimal pebbling of Cartesian product of Graphs
by: Ying-Zhen Chen, et al.
Published: (2016) -
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019)