Show simple item record

The t-pebbling number of Jahangir graph J3,m

dc.creatorLourdusamy, A.
dc.creatorMathivanan, T.
dc.date2015-06-01
dc.date.accessioned2019-11-14T11:59:12Z
dc.date.available2019-11-14T11:59:12Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1258
dc.identifier10.4067/S0716-09172015000200005
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113049
dc.descriptionThe 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-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1258/971
dc.rightsDerechos de autor 2015 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 34 No 2 (2015); 161-174en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 34 Núm. 2 (2015); 161-174es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectPebbling numberes-ES
dc.subjectJahangir graph.es-ES
dc.titleThe t-pebbling number of Jahangir graph J3,mes-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record