411 research outputs found

    Critical Pebbling Numbers of Graphs

    Full text link
    We define three new pebbling parameters of a connected graph GG, the rr-, gg-, and uu-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices nn and the diameter dd of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the rr-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the rr-critical pebbling number is 2d2^d.Comment: 26 page

    Optimal Pebbling in Products of Graphs

    Full text link
    We prove a generalization of Graham's Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal tt-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5C_5. Finally, we present explicit distributions which provide asymptotic bounds on optimal pebbling numbers of hypercubes.Comment: 28 pages, 1 figur

    More on the 22-restricted optimal pebbling number

    Full text link
    Let G=(V,E)G=(V,E) be a simple graph. A function f:V→N∪{0}f:V\rightarrow \mathbb{N}\cup \{0\} is called a configuration of pebbles on the vertices of GG and the weight of ff is w(f)=∑u∈Vf(u)w(f)=\sum_{u\in V}f(u) which is just the total number of pebbles assigned to vertices. A pebbling step from a vertex uu to one of its neighbors vv reduces f(u)f(u) by two and increases f(v)f(v) by one. A pebbling configuration ff is said to be solvable if for every vertex v v , there exists a sequence (possibly empty) of pebbling moves that results in a pebble on vv. A pebbling configuration ff is a tt-restricted pebbling configuration (abbreviated ttRPC) if f(v)≤tf(v)\leq t for all v∈Vv\in V. The tt-restricted optimal pebbling number πt∗(G)\pi_t^*(G) is the minimum weight of a solvable ttRPC on GG. Chellali et.al. [Discrete Appl. Math. 221 (2017) 46-53] characterized connected graphs GG having small 22-restricted optimal pebbling numbers and characterization of graphs GG with π2∗(G)=5\pi_2^*(G)=5 stated as an open problem. In this paper, we solve this problem. We improve the upper bound of the 22-restricted optimal pebbling number of trees of order nn. Also, we study 22-restricted optimal pebbling number of some grid graphs, corona and neighborhood corona of two specific graphs.Comment: 12 pages, 11 figure

    The optimal pebbling number of staircase graphs

    Get PDF
    Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The optimal pebbling number of G is the smallest number of pebbles which can be placed on the vertices of G such that, for any vertex v of G, there is a sequence of pebbling moves resulting in at least one pebble on v. We determine the optimal pebbling number for several classes of induced subgraphs of the square grid, which we call staircase graphs. © 2018 Elsevier B.V
    • …
    corecore