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

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alcón, Liliana Graciela, Gutiérrez, Marisa, Hurlbert, Glenn
Formato: Articulo
Lenguaje:Inglés
Publicado: 2018
Materias:
Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/162597
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-162597
record_format dspace
spelling I19-R120-10915-1625972024-02-09T20:51:00Z http://sedici.unlp.edu.ar/handle/10915/162597 t-Pebbling in k-connected graphs with a universal vertex Alcón, Liliana Graciela Gutiérrez, Marisa Hurlbert, Glenn 2018 2024-02-09T18:05:20Z en Ciencias Exactas Matemática graph pebbling pebbling number connectivity 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 Articulo Articulo http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) application/pdf 38-46
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
spellingShingle Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
Alcón, Liliana Graciela
Gutiérrez, Marisa
Hurlbert, Glenn
t-Pebbling in k-connected graphs with a universal vertex
topic_facet Ciencias Exactas
Matemática
graph pebbling
pebbling number
connectivity
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.
format Articulo
Articulo
author Alcón, Liliana Graciela
Gutiérrez, Marisa
Hurlbert, Glenn
author_facet Alcón, Liliana Graciela
Gutiérrez, Marisa
Hurlbert, Glenn
author_sort Alcón, Liliana Graciela
title t-Pebbling in k-connected graphs with a universal vertex
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
publishDate 2018
url http://sedici.unlp.edu.ar/handle/10915/162597
work_keys_str_mv AT alconlilianagraciela tpebblinginkconnectedgraphswithauniversalvertex
AT gutierrezmarisa tpebblinginkconnectedgraphswithauniversalvertex
AT hurlbertglenn tpebblinginkconnectedgraphswithauniversalvertex
_version_ 1807222410718478336

Ejemplares similares