Graham's pebbling conjecture on the middle graphs of even cycles.
From MaRDI portal
(Redirected from Publication:4598975)
Abstract: A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number of a graph , denoted by , is the least integer such that, however pebbles are located on the vertices of , we can move one pebble to any vertex by a sequence of pebbling moves. Let be the middle graph of . For any connected graphs and , Graham conjectured that . In this paper, we give the pebbling number of some graphs and prove that Graham's conjecture holds for the middle graphs of some even cycles.
Recommendations
Cited in
(4)
This page was built for publication: Graham's pebbling conjecture on the middle graphs of even cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598975)