The t-pebbling number of Lamp graphs

Abstract Let G be a graph and some pebbles are distributed on its vertices. A pebbling move (step) consists of removing two pebbles from one vertex, throwing one pebble away, and moving the other pebble to an adjacent vertex. The t-pebbling number of a graph G is the least integer m such that from a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Lourdusamy,A., Patrick,F., Mathivanan,T.
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2018
Materias:	Pebbling number t-Pebbling number Lamp graphs
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000300503
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172018000300503
record_format	dspace
spelling	oai:scielo:S0716-091720180003005032018-10-10The t-pebbling number of Lamp graphsLourdusamy,A.Patrick,F.Mathivanan,T. Pebbling number t-Pebbling number Lamp graphs Abstract Let G be a graph and some pebbles are distributed on its vertices. A pebbling move (step) consists of removing two pebbles from one vertex, throwing one pebble away, and moving the other pebble to an adjacent vertex. The t-pebbling number of a graph G is the least integer m such that from any distribution of m pebbles on the vertices of G, we can move t pebbles to any specified vertex by a sequence of pebbling moves. In this paper, we determine the t-pebbling number of Lamp graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.37 n.3 20182018-09-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000300503en10.4067/S0716-09172018000300503
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Pebbling number t-Pebbling number Lamp graphs
spellingShingle	Pebbling number t-Pebbling number Lamp graphs Lourdusamy,A. Patrick,F. Mathivanan,T. The t-pebbling number of Lamp graphs
description	Abstract Let G be a graph and some pebbles are distributed on its vertices. A pebbling move (step) consists of removing two pebbles from one vertex, throwing one pebble away, and moving the other pebble to an adjacent vertex. The t-pebbling number of a graph G is the least integer m such that from any distribution of m pebbles on the vertices of G, we can move t pebbles to any specified vertex by a sequence of pebbling moves. In this paper, we determine the t-pebbling number of Lamp graphs.
author	Lourdusamy,A. Patrick,F. Mathivanan,T.
author_facet	Lourdusamy,A. Patrick,F. Mathivanan,T.
author_sort	Lourdusamy,A.
title	The t-pebbling number of Lamp graphs
title_short	The t-pebbling number of Lamp graphs
title_full	The t-pebbling number of Lamp graphs
title_fullStr	The t-pebbling number of Lamp graphs
title_full_unstemmed	The t-pebbling number of Lamp graphs
title_sort	t-pebbling number of lamp graphs
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2018
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000300503
work_keys_str_mv	AT lourdusamya thetpebblingnumberoflampgraphs AT patrickf thetpebblingnumberoflampgraphs AT mathivanant thetpebblingnumberoflampgraphs AT lourdusamya tpebblingnumberoflampgraphs AT patrickf tpebblingnumberoflampgraphs AT mathivanant tpebblingnumberoflampgraphs
_version_	1718439838065098752

The t-pebbling number of Lamp graphs

Ejemplares similares