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

DOI10.1142/S1793557122500310zbMath1482.05232OpenAlexW3159471409MaRDI QIDQ5064377

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 graphgraph pebblingGraham's conjectureclass 0 graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The pebbling number of \(C_5\times C_5\)
• Graham's pebbling conjecture on product of complete bipartite graphs
• The weight function lemma for graph pebbling
• Pebbling in Hypercubes
• Pebbling on Graph Products and other Binary Graph Constructions
• 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

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