|
|
|
|
The t-pebbling number of some wheel related graphs
|
|
|
|
|
|
|
|
نویسنده
|
lourdusamy a. ,patrick f. ,mathivanan t.
|
|
منبع
|
journal of prime research in mathematics - 2016 - دوره : 12 - شماره : 1 - صفحه:35 -44
|
|
چکیده
|
Let g be a graph and some pebbles are distributed on its vertices. a pebbling move (step) consists of removing two pebbles from one vertex,throwing one pebble away,and moving the other pebble to an adjacent vertex. the t-pebbling number of a graph g is the least integer m such that from any distribution of m pebbles on the vertices of g,we can move t pebbles to any specified vertex by a sequence of pebbling moves. in this paper,we determine the t-pebbling number of some wheel related graphs. © 2016,journal of prime research in mathematics.
|
|
کلیدواژه
|
Pebbling number; Wheel graphs
|
|
آدرس
|
department of mathematics,st. xavier's college (autonomous),palayamkottai,tamilnadu, India, department of mathematics,st. xavier's college (autonomous),palayamkottai,tamilnadu, India, department of mathematics,st. xavier's college (autonomous),palayamkottai,tamilnadu, India
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|