Optimal pebbling of Cartesian product of Graphs
碩士 === 國立東華大學 === 應用數學系 === 104 === Given a graph G, a distribution of pebbles on the vertices of G is a function D:V(G)→ℕ∪{0}. A basic pebbling move from a vertex v to a neighbor u takes away two pebbles at v and adds one pebble at u. Before the move, v must have at least two pebbles. A pebbling...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73288408397953881699 |