Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing a pebble on v. We seek an initial placement of a minimum total number of pebbles on the vertices in V, so that no vertex receives more than one pebble and for any given vertex v ∈ V, it is possible, by a sequence of pebbling and rubbling moves, to move at least one pebble to v. This minimum number of pebbles is the 1-restricted optimal rubbling number. We determine the 1-restricted optimal rubbling numbers for Cartesian products. We also present bounds on the 1-restricted optimal rubbling number.
 R.A. Beeler, T.W. Haynes and K. Murphy, An introduction to t-restricted optimal rubbling, Congr. Numer., to appear.
 C. Belford and N. Sieben, Rubbling and optimal rubbling of graphs, Discrete Math. 309 (2009) 3436–3446. doi:10.1016/j.disc.2008.09.035
 T.A. Clarke, R.A. Hochberg and G.H. Hurlbert, Pebbling in diameter two graphs and products of paths, J. Graph Theory 25 (1997) 119–128. doi:10.1002/(SICI)1097-0118(199706)25:2⟨119::AID-JGT3⟩3.0.CO;2-P
 R. Feng and J.Y. Kim, Graham’s pebbling conjecture on product of complete bipartite graphs, Sci. China Ser. A–Math. 44 (2001) 817–822. doi:10.1007/BF02880130
 H.-L. Fu and C.-L. Shiue, The optimal pebbling number of the complete m-ary tree, Discrete Math. 222 (2000) 89–100. doi:10.1016/S0012-365X(00)00008-X
 D.S. Herscovici, Graham’s pebbling conjecture on products of cycles, J. Graph Theory 42 (2003) 141–154. doi:10.1002/jgt.10080
 G.Y. Katona and L.F. Papp, The optimal rubbling number of ladders, prisms and Möbius-ladders, Discrete Appl. Math. 209 (2016) 227–246. doi:10.1016/j.dam.2015.10.026
 G.Y. Katona and N. Sieben, Bounds on the rubbling and optimal rubbling numbers of graphs, Graphs Combin. 29 (2013) 535–551. doi:10.1007/s00373-012-1146-2
SCImago Journal Rank (SJR) 2017: 0.633 Source Normalized Impact per Paper (SNIP) 2017: 1.095
Mathematical Citation Quotient (MCQ) 2017: 0.36
researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs