| dc.creator | Lourdusamy, A. | |
| dc.creator | Steffi, J. Jenifer | |
| dc.date | 2019-08-14 | |
| dc.identifier | https://www.revistaproyecciones.cl/article/view/3710 | |
| dc.identifier | 10.22199/issn.0717-6279-2019-03-0038 | |
| dc.description | 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. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/article/view/3710/3224 | |
| dc.rights | Copyright (c) 2019 A. Lourdusamy | en-US |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol 38 No 3 (2019); 597-615 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 38 Núm. 3 (2019); 597-615 | es-ES |
| dc.source | 0717-6279 | |
| dc.subject | Graph pebbling | en-US |
| dc.subject | Zig-zag chain graph | en-US |
| dc.title | Pebbling on zig-zag chain graph of n odd cycles | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
| dc.type | texto | es-ES |
