کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6423967 1632593 2011 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs
چکیده انگلیسی

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 rubbling number is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. 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 give bounds for rubbling and optimal rubbling numbers.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 38, 1 December 2011, Pages 487-492
نویسندگان
, ,