Pebbling on zig-zag chain graph of n odd cycles

Abstract Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of G, f (G), is the least n such that any distribution of n pebbles on G allows one...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Lourdusamy,A., Steffi,J. Jenifer
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2019
Materias:	Graph pebbling Zig-zag chain graph
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000300597
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172019000300597
record_format	dspace
spelling	oai:scielo:S0716-091720190003005972019-08-28Pebbling on zig-zag chain graph of n odd cyclesLourdusamy,A.Steffi,J. Jenifer Graph pebbling Zig-zag chain graph Abstract Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of G, f (G), is the least n such that any distribution of n pebbles on G allows one pebble to be reached to any specified, but an arbitrary vertex. Similarly, the t−pebbling number of G, ft(G), is the least m such that from any distribution of m pebbles, we can move t pebbles to any specified, but an arbitrary vertex. In this paper, we determine the pebbling number, and the t−pebbling number of the zigzag chain graph of n copies of odd cycles.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.38 n.3 20192019-08-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000300597en10.22199/issn.0717-6279-2019-03-0038
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Graph pebbling Zig-zag chain graph
spellingShingle	Graph pebbling Zig-zag chain graph Lourdusamy,A. Steffi,J. Jenifer Pebbling on zig-zag chain graph of n odd cycles
description	Abstract Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of G, f (G), is the least n such that any distribution of n pebbles on G allows one pebble to be reached to any specified, but an arbitrary vertex. Similarly, the t−pebbling number of G, ft(G), is the least m such that from any distribution of m pebbles, we can move t pebbles to any specified, but an arbitrary vertex. In this paper, we determine the pebbling number, and the t−pebbling number of the zigzag chain graph of n copies of odd cycles.
author	Lourdusamy,A. Steffi,J. Jenifer
author_facet	Lourdusamy,A. Steffi,J. Jenifer
author_sort	Lourdusamy,A.
title	Pebbling on zig-zag chain graph of n odd cycles
title_short	Pebbling on zig-zag chain graph of n odd cycles
title_full	Pebbling on zig-zag chain graph of n odd cycles
title_fullStr	Pebbling on zig-zag chain graph of n odd cycles
title_full_unstemmed	Pebbling on zig-zag chain graph of n odd cycles
title_sort	pebbling on zig-zag chain graph of n odd cycles
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2019
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000300597
work_keys_str_mv	AT lourdusamya pebblingonzigzagchaingraphofnoddcycles AT steffijjenifer pebblingonzigzagchaingraphofnoddcycles
_version_	1718439853634355200

Pebbling on zig-zag chain graph of n odd cycles

Ejemplares similares