|
|
|
|
The 2-Pebbling Property of the Middle Graph of Fan Graphs
|
|
|
|
|
|
|
|
نویسنده
|
ye y. ,liu f. ,shi c.
|
|
منبع
|
journal of applied mathematics - 2014 - دوره : 2014 - شماره : 0
|
|
چکیده
|
A pebbling move on a graph g consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. the pebbling number of a connected graph g,denoted by f (g),is the least n such that any distribution of n pebbles on g allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves. this paper determines the pebbling numbers and the 2-pebbling property of the middle graph of fan graphs. © 2014 yongsheng ye et al.
|
|
|
|
|
آدرس
|
school of mathematical sciences,huaibei normal university,huaibei, China, school of mathematical sciences,huaibei normal university,huaibei, China, school of mathematical sciences,huaibei normal university,huaibei, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|