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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/3tnr33 |