Weighted pebbling numbers on graphs

zbMATH Open1367.05140arXiv1106.1625MaRDI QIDQ5267508FDOQ5267508

Authors: Joshua D. Laison, Cam McLeman, Stephanie Partlow, Kathryn Nyman 

Publication date: 13 June 2017

Abstract: We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of pebbles on the vertices. Player one wins if, through a series of pebbling moves, he can move at least one pebble to the target. A pebbling move of p pebbles across an edge with weight w leaves the floor of pw pebbles on the next vertex. We find the weighted pebbling numbers of stars, graphs with at least 2|V|-1 edges, and trees with given targets. We give an explicit formula for the minimum total weight required on the edges of a length-2 path, solvable with p pebbles and exhibit a graph which requires an edge with weight 1/3 in order to achieve its weighted pebbling number.

Full work available at URL: https://arxiv.org/abs/1106.1625

Recommendations

• Pebbling numbers of some graphs
• A Graph Pebbling Algorithm on Weighted Graphs
• scientific article; zbMATH DE number 1040545
• The weight function lemma for graph pebbling
• Critical pebbling numbers of graphs
• Pebbling number of some bipartite graphs
• \(t\)-pebbling number in graphs
• On the enumeration of certain weighted graphs
• scientific article; zbMATH DE number 1941839
• The \(t\)-pebbling number of graphs

zbMATH Keywords

pebbling numberweighted pebbling number

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57)

Cited In (8)

• The weight function lemma for graph pebbling
• The \(t\)-pebbling number is eventually linear in \(t\)
• Title not available (Why is that?)
• The cover pebbling theorem
• Pebbling graph products.
• A Graph Pebbling Algorithm on Weighted Graphs
• Title not available (Why is that?)
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs

This page was built for publication: Weighted pebbling numbers on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267508)