Pebbling in Hypercubes
From MaRDI portal
Publication:3348937
DOI10.1137/0402041zbMATH Open0727.05043OpenAlexW2013252038WikidataQ30052298 ScholiaQ30052298MaRDI QIDQ3348937FDOQ3348937
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402041
Recommendations
Cited In (96)
- The \(t\)-pebbling number of \(C_5\square C_5\)
- Herscovici’s conjecture on C2n × G
- Optimal pebbling and rubbling of graphs with given diameter
- Cover Pebbling Thresholds for the Complete Graph
- Generalizedt-pebbling number of a graph
- The pebbling threshold of the square of cliques
- Graham's pebbling conjecture on products of many cycles
- The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree
- A note on optimal pebbling of hypercubes
- The proof of a conjecture due to Snevily
- Domination cover rubbling
- The weight function lemma for graph pebbling
- An improved upper bound for the pebbling threshold of the \(n\)-path
- The pebbling number of \(C_5\times C_5\)
- Title not available (Why is that?)
- Graham's pebbling conjecture on product of complete bipartite graphs
- Pebbling graphs of diameter three and four
- Saving probe bits by cube domination
- Total domination cover rubbling
- Cover rubbling and stacking
- Network decontamination with a single agent
- Optimal pebbling on grids
- \(t\)-pebbling and extensions
- On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs
- Title not available (Why is that?)
- Optimal pebbling of graphs
- Bounds for the pebbling number of product graphs
- A new lower bound on the optimal pebbling number of the grid
- Counterexamples to a monotonicity conjecture for the threshold pebbling number
- Generalizations of Graham's pebbling conjecture
- Improved pebbling bounds
- The cover pebbling number of graphs
- Pebbling numbers of some graphs
- The 2-pebbling property of squares of paths and Graham's conjecture
- Rubbling and optimal rubbling of graphs
- Pebbling number of squares of odd cycles
- The pebbling number of squares of even cycles
- Two-player pebbling on diameter 2 graphs
- Doppelgangers and Lemke graphs
- Pebbling graphs
- Graph pegging numbers
- Threshold and complexity results for the cover pebbling game
- On an inverse problem of Erdős, Kleitman, and Lemke
- On the Relative Strength of Pebbling and Resolution
- Optimally pebbling hypercubes and powers
- Tiny zero-sum sequences over some special groups
- The 2-pebbling property for dense graphs
- On a combinatorial problem of Erdős, Kleitman and Lemke
- Lemke graphs and Graham's pebbling conjecture
- Graph pebbling algorithms and Lemke graphs
- A tight bound for black and white pebbles on the pyramid
- Using error-correcting codes to construct solvable pebbling distributions
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Strict optimal rubbling of graphs
- Restricted optimal pebbling and domination in graphs
- Two-pebbling and odd-two-pebbling are not equivalent
- Optimal pebbling number of graphs with given minimum degree
- General graph pebbling
- Title not available (Why is that?)
- Optimal pebbling number of the square grid
- Pebbling in semi-2-trees
- Title not available (Why is that?)
- Monophonic pebbling number of some network-related graphs
- Pebbling on Graph Products and other Binary Graph Constructions
- Maximal matching cover pebbling number for variants of hypercube
- The optimal pebbling of spindle graphs
- Monophonic pebbling number and t-pebbling number of some graphs
- The 2-pebbling property of the middle graph of fan graphs
- NDC pebbling number for some class of graphs
- Computing bounds on product graph pebbling numbers
- Pebbling Graphs of Diameter Three and Four
- Pebbling on zig-zag chain graph of n odd cycles
- Modified linear programming and class 0 bounds for graph pebbling
- Beyond NP: Quantifying over Answer Sets
- Pebble sets in convex polygons
- Restricted optimal pebbling is NP-hard
- Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
- Pebbling number and 2-pebbling property for the middle graphs of the graph obtained from fan graph by deleting \(f\) independent edges
- The t-pebbling number of Lamp graphs
- On the target pebbling conjecture
- On binary DCP labeling
- A note on pebbling bound for a product of Class 0 graphs
- Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs
- Monophonic pebbling number of some families of cycles
- Automating weight function generation in graph pebbling
- Cycles and girth in pebble assignment graphs
- Title not available (Why is that?)
- On the secure vertex cover pebbling number
- Title not available (Why is that?)
- Pebbling Graphs of Fixed Diameter
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- Pebbling in powers of paths
- PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE
- SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
- The t-pebbling number of Jahangir graph J3,m
- Pebbling in Kneser graphs
This page was built for publication: Pebbling in Hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348937)
