Graph pebbling number and model

Abstract

There are many topics in graph theory that can be called ``moving objects around a graph". For example; In network optimization, shipments are transferred from some vertices (resources) to other vertices (demand) according to the costs allocated to the edges, so that this can be done in the cheapest way. A pebble motion in a graph involves removing two pebbles from the vertex of a graph and then placing a pebble at the adjacent vertex. If a distribution (or configuration) of pebbles allows us to move at least one pebble to each vertex by repeatedly applying pebble movements, then that distribution is called a pebble of the graph. One of the most basic questions is how many pebbles are needed to ensure that any configuration with this number can target a pebble at any particular target. The smallest number of stones that meet this condition is called the graph pebble number. In this paper, after examining the roots of the number theory of the pebble graph model, which in turn is a productive subject, we will study the pebble number for specific graphs and also consider an optimization approach to this subject called weight functions.

Keywords

• graph pebbling
• pebble numbr
• configuration&lrm