The t-pebbling number of Jahangir graph J3,m
The t-pebbling number, f t(G), of a connected graph G, is the smallest positive integer such that from every placement of f t(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move removes two pebbles of a vertex and placing one on an adjacent ve...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000200005 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | The t-pebbling number, f t(G), of a connected graph G, is the smallest positive integer such that from every placement of f t(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move removes two pebbles of a vertex and placing one on an adjacent vertex. In this paper, we determine the t-pebbling number for Jahangir graph J3,m and finally we give a conjecture for the t-pebbling number of the graph Jn,m. |
|---|