The 2-Pebbling Property of the Middle Graph of Fan Graphs
Joint Authors
Ye, Yongsheng
Liu, Fang
Shi, Caixia
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-07-21
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Ye, Yongsheng& Liu, Fang& Shi, Caixia. 2014. The 2-Pebbling Property of the Middle Graph of Fan Graphs. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-461866
Modern Language Association (MLA)
Ye, Yongsheng…[et al.]. The 2-Pebbling Property of the Middle Graph of Fan Graphs. Journal of Applied Mathematics No. 2014 (2014), pp.1-5.
https://search.emarefa.net/detail/BIM-461866
American Medical Association (AMA)
Ye, Yongsheng& Liu, Fang& Shi, Caixia. The 2-Pebbling Property of the Middle Graph of Fan Graphs. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-461866
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-461866
