Bounds for the pebbling number of product graphs

DOI10.22108/toc.2021.128705.1855OpenAlexW4382490396MaRDI QIDQ5104010

Somnuek Worawiset, Nopparat Pleanmani, Nuttawoot Nupo

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/bb8baf1a4dfe4aaaa389f8ed9fe99c9b

zbMATH Keywords

coronaproduct graphgraph pebblingGraham's conjecture

Mathematics Subject Classification ID

Games involving graphs (91A43) Connectivity (05C40) 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
• Pebbling and Graham's conjecture
• 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
• Algebraic graph theory. Morphisms, monoids and matrices

This page was built for publication: Bounds for the pebbling number of product graphs