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...
Guardado en:
Autores principales: | Lourdusamy,A., Patrick,F., Mathivanan,T. |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2018
|
Materias: | |
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!
|
Ejemplares similares
-
The t-pebbling number of Jahangir graph J3,m
por: Lourdusamy,A., et al.
Publicado: (2015) -
Pebbling on zig-zag chain graph of n odd cycles
por: Lourdusamy,A., et al.
Publicado: (2019) -
On graphs whose chromatic transversal number is two
por: Ayyaswamy,S.K, et al.
Publicado: (2011) -
The nonsplit domination in subdivision graph
por: Chrislight,R. Jemimal, et al.
Publicado: (2020) -
Equitable Graph of a Graph
por: Dharmalingam,Kuppusamy
Publicado: (2012)