The 2‐Pebbling Property of the Middle Graph of Fan Graphs

Yongsheng Ye, Fang Liu and Caixia Shi

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/304514

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:304514

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().