Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2024-02-09T18:05:20Z
dc.date.available 2024-02-09T18:05:20Z
dc.date.issued 2018
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/162597
dc.description.abstract The t-pebbling number is the smallest integer m so that any initially distributed supply of m pebbles can place t pebbles on any target vertex via pebbling moves. The 1-pebbling number of diameter 2 graphs is well-studied. Here we investigate the t-pebbling number of diameter 2 graphs under the lens of connectivity. en
dc.format.extent 38-46 es
dc.language en es
dc.subject graph pebbling es
dc.subject pebbling number es
dc.subject connectivity es
dc.title t-Pebbling in k-connected graphs with a universal vertex en
dc.type Articulo es
sedici.identifier.uri https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/46-P03.pdf es
sedici.identifier.issn 2317-6636 es
sedici.creator.person Alcón, Liliana Graciela es
sedici.creator.person Gutiérrez, Marisa es
sedici.creator.person Hurlbert, Glenn es
sedici.subject.materias Ciencias Exactas es
sedici.subject.materias Matemática es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Exactas es
mods.originInfo.place Departamento de Matemática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Matemática Contemporânea es
sedici.relation.journalVolumeAndIssue vol. 46 es


Download Files

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)