Cover pebbling number of some product graphs

zbMATH Open1199.05284MaRDI QIDQ3403012FDOQ3403012

Authors: Wei Kong, Chao Yang, Yongliang Pan 

Publication date: 12 February 2010

Recommendations

• The cover pebbling number of graphs
• Cover pebbling numbers and bounds for certain families of graphs
• Covering cover pebbling number for square of a path
• Covering cover pebbling number for square of a cycle
• Cover pebbling number for square of a path

zbMATH Keywords

strong productlexicographic productcover pebblingkey vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cited In (5)

• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Cover pebbling numbers and bounds for certain families of graphs
• Title not available (Why is that?)
• The cover pebbling number of graphs
• Covering cover pebbling number of a hyperbube \& diameter \(d\) graphs

This page was built for publication: Cover pebbling number of some product graphs

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