Pebbling on some braid graphs
Abstract
Given a distribution of pebbles on the vertices of a connected graph, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of those pebbles at an adjacent vertex. The pebbling number, f(G) of a connected graph G, is the smallest positive integer such that from every placement of f(G) pebbles, we can move a pebble to any specified vertex by a sequence of pebbling moves. In this paper, we find the pebbling number for some braid graphs.
Copyright © 2020 A. Lourdusamy, S. Saratha Nellainayaki. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. Lourdusamy, S. S. Nellainayaki, Pebbling on some braid graphs, J. Math. Comput. Sci. 11 (2021), 625–634. https://doi.org/10.28919/jmcs/5174
BibTeX
@article{Lourdusamy2021,
author = {Lourdusamy, A. and Nellainayaki, S. Saratha},
title = {Pebbling on some braid graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {625--634},
doi = {10.28919/jmcs/5174}
}