We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The 2t-Pebbling Property on the Jahangir Graph J<sub>2, m</sub>.
- Authors
Lourdusamy, A.; Mathivanan, T.
- Abstract
The t-pebbling number, ft(G), of a connected graph G, is the smallest positive integer such that from every placement of ft(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move taking two pebbles of a vertex and placing one on an adjacent vertex. A graph G satisfies the 2t-pebbling property if 2t pebbles can be moved to a specified vertex when the total starting number of pebbles is 2ft(G) - q + 1 where q is the number of vertices with at least one pebble. In this paper, we are going to show that the graph J2, m (m ≥ 3) satisfies the 2t-pebbling property.
- Subjects
INTEGERS; GEOMETRIC vertices; GRAPH theory; GRAPHIC methods; GEOMETRY
- Publication
General Mathematics Notes, 2015, Vol 28, Issue 1, p18
- ISSN
2219-7184
- Publication type
Article