Katona, Gyula Y. and Papp, László F. (2016) The optimal rubbling number of ladders, prisms and Möbiusladders. DISCRETE APPLIED MATHEMATICS, 209. pp. 227246. ISSN 0166218X

Text
ladder_v10.pdf Download (325Kb)  Preview 
Abstract
Abstract A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices v and w adjacent to a vertex u , and an extra pebble is added at vertex u . A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The optimal rubbling number is the smallest number m needed to guarantee a pebble distribution of m pebbles from which any vertex is reachable. We determine the optimal rubbling number of ladders ( P n □ P 2 ), prisms ( C n □ P 2 ) and Möbiusladders.
Item Type:  Article 

Uncontrolled Keywords:  LADDER; Rubbling; GRAPHS 
Subjects:  Q Science / természettudomány > QA Mathematics / matematika > QA166QA166.245 Graphs theory / gráfelmélet 
SWORD Depositor:  MTMT SWORD 
Depositing User:  MTMT SWORD 
Date Deposited:  07 Sep 2016 07:01 
Last Modified:  07 Sep 2016 07:01 
URI:  http://real.mtak.hu/id/eprint/39359 
Actions (login required)
View Item 