Optimal pebbling
The optimal pebbling number of G, denoted fopt(G), is the least number of pebbles, such that for some distribution of fopt(G) pebbles, a pebble can be moved to any vertex of G.
To know more about this variant, one could go through the linked articles(click here)
Cover pebbling
The cover pebbling number γ(G) is the minimum number so that every configuration of γ(G) pebbles has the property that, after some sequence of pebbling steps, every vertex has a pebble on it.
To know more details about this variant, kindly go through the linked articles (click here)
Domination cover pebbling
The domination cover pebbling number, ψ(G), of a graph G is the minimum number of pebbles that have to be placed on V (G) such that after a sequence of pebbling moves, the set of vertices with pebbles forms a dominating set of G, regardless of the initial configuration.
Click here to know more about this variant.
Covering cover pebbling
The covering cover pebbling number, σ(G), is the least number such that after a sequence of pebbling moves, the set of vertices should form a covering for G from every configuration of σ(G) pebbles on the vertices of G.
For more details on this variant, one could go through the linked articles (click here)
Maximum independent set cover pebbling
The maximum independent set cover pebbling number, ρ(G), of a graph G is the minimum number of pebbles that are placed on V(G) such that after a sequence of pebbling moves, the set of vertices with pebbles forms a maximum independent set of G, regardless of their initial configuration.
For more details on this variant, one could go through the linked articles (Click here)
Pebbling thresholds
Click here, to know more details about this.
Pebbling complexity
Click here, to know more details about this.
Weighted pebbling
Click here, to know more details about this.