$t$-Pebbling in $k$-connected diameter two graphs

Liliana Alcón; Marisa Gutierrez; Glenn Hurlbert

$t$-Pebbling in $k$-connected diameter two graphs

Combinatorics 2019-03-05 v1

Authors: Liliana Alcón , Marisa Gutierrez , Glenn Hurlbert

Abstract

Graph pebbling models the transportation of consumable resources. As two pebbles move across an edge, one reaches its destination while the other is consumed. 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 two graphs is well-studied. Here we investigate the $t$ -pebbling number of diameter two graphs under the lense of connectivity.

Keywords

graph pebbling graph theory

Cite

@article{arxiv.1903.00554,
  title  = {$t$-Pebbling in $k$-connected diameter two graphs},
  author = {Liliana Alcón and Marisa Gutierrez and Glenn Hurlbert},
  journal= {arXiv preprint arXiv:1903.00554},
  year   = {2019}
}

Comments

6 pages, 1 figure

$t$-Pebbling in $k$-connected diameter two graphs

Abstract

Keywords

Cite

Comments

Related papers