t-Pebbling in k-connected graphs with a universal vertex

Autores
Alcón, Liliana Graciela; Gutiérrez, Marisa; Hurlbert, Glenn
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Facultad de Ciencias Exactas
Departamento de Matemática
Materia
Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/162597
Acceder
id SEDICI_25040c66276a52e13b2f9bb920df2012
oai_identifier_str oai:sedici.unlp.edu.ar:10915/162597
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling t-Pebbling in k-connected graphs with a universal vertexAlcón, Liliana GracielaGutiérrez, MarisaHurlbert, GlennCiencias ExactasMatemáticagraph pebblingpebbling numberconnectivityThe 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.Facultad de Ciencias ExactasDepartamento de Matemática2018info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf38-46http://sedici.unlp.edu.ar/handle/10915/162597enginfo:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/46-P03.pdfinfo:eu-repo/semantics/altIdentifier/issn/2317-6636info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T17:23:39Zoai:sedici.unlp.edu.ar:10915/162597Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 17:23:40.103SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv t-Pebbling in k-connected graphs with a universal vertex
title t-Pebbling in k-connected graphs with a universal vertex
spellingShingle t-Pebbling in k-connected graphs with a universal vertex
Alcón, Liliana Graciela
Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
title_short t-Pebbling in k-connected graphs with a universal vertex
title_full t-Pebbling in k-connected graphs with a universal vertex
title_fullStr t-Pebbling in k-connected graphs with a universal vertex
title_full_unstemmed t-Pebbling in k-connected graphs with a universal vertex
title_sort t-Pebbling in k-connected graphs with a universal vertex
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
Gutiérrez, Marisa
Hurlbert, Glenn
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Gutiérrez, Marisa
Hurlbert, Glenn
author_role author
author2 Gutiérrez, Marisa
Hurlbert, Glenn
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
topic Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
dc.description.none.fl_txt_mv 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.
Facultad de Ciencias Exactas
Departamento de Matemática
description 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.
publishDate 2018
dc.date.none.fl_str_mv 2018
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/162597
url http://sedici.unlp.edu.ar/handle/10915/162597
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/46-P03.pdf
info:eu-repo/semantics/altIdentifier/issn/2317-6636
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
38-46
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846783684931223552
score 12.982451

Publicaciones similares