A note on pebbling bound for a product of class 0 graphs

DOI10.1142/S1793557122500310MaRDI QIDQ5064377zbMATH OpenOpenAlexFDO

Authors Nopparat Pleanmani, Somnuek Worawiset

Publication date 15 March 2022

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793557122500310

zbMATH Keywords

Cartesian product graphclass 0 graphGraham's conjecturegraph pebbling

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Bounds for the pebbling number of product graphs
• Modified linear programming and class 0 bounds for graph pebbling
• Pebbling number of Bi-wheel: a diameter three class 0 graph.
• Pebbling in diameter two graphs and products of paths
• scientific article; zbMATH DE number 1040545

Cites work

• Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
• Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph
• Graham's pebbling conjecture on product of complete bipartite graphs
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Pebbling in Hypercubes
• Pebbling on graph products and other binary graph constructions
• The pebbling number of \(C_5\times C_5\)
• The weight function lemma for graph pebbling

Cited in

(3)

• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Modified linear programming and class 0 bounds for graph pebbling
• Bounds for the pebbling number of product graphs

This page was built for publication: A note on pebbling bound for a product of class 0 graphs

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