Name
Abstract | ||
|---|---|---|
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denoted f(G), is the minimal number of pebbles such that every configuration of f(G) pebbles on G is solvable. We derive several general upper bounds on the pebbling number, improving previous results. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2006.06.032 | Discrete Mathematics |
Keywords | Field | DocType |
05C99 | Discrete mathematics,Graph,Combinatorics,Dominating set,Vertex (geometry),Upper and lower bounds,Neighbourhood (graph theory),Pebble,Connectivity,Distribution function,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 11 | 0012-365X |
Citations | PageRank | References |
2 | 0.37 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Melody Chan | 1 | 2 | 0.37 |
| Anant P. Godbole | 2 | 95 | 16.08 |