| The graph on the picture has a non-greedy configuration: to get to the root vertex (R) you need to move away from it first. This configuration uses 8 pebbles and the pebbling number of the graph is 9. Can you find a graph with non-greedy configuration that has as many pebbles as its pebbling number? |
|