The t-pebbling number of Jahangir graph J3,m

dc.creator	Lourdusamy, A.	es
dc.creator	Mathivanan, T.	es
dc.date	2025-04-17
dc.date.accessioned	2025-10-06T15:04:54Z
dc.date.available	2025-10-06T15:04:54Z
dc.identifier	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1258
dc.identifier	10.4067/S0716-09172015000200005
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/255428
dc.description	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 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.	es
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Católica del Norte.	en
dc.relation	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1258/971
dc.rights	Copyright (c) 2015 Proyecciones. Journal of Mathematics	en
dc.rights	https://creativecommons.org/licenses/by/4.0	en
dc.source	Proyecciones (Antofagasta); Vol. 34 No. 2 (2015); 161-174	en
dc.source	Proyecciones. Revista de Matemática; Vol. 34 Núm. 2 (2015); 161-174	es
dc.source	0717-6279
dc.source	10.22199/issn.0717-6279-2015
dc.title	The t-pebbling number of Jahangir graph J3,m	es
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion