The 2-Pebbling Property of the Middle Graph of Fan Graphs
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 arbitra...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/304514 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850176054497378304 |
|---|---|
| author | Yongsheng Ye Fang Liu Caixia Shi |
| author_facet | Yongsheng Ye Fang Liu Caixia Shi |
| author_sort | Yongsheng Ye |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-b9e538b52a7a4cb9833ba95ff3c5b4b4 |
| institution | OA Journals |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-b9e538b52a7a4cb9833ba95ff3c5b4b42025-08-20T02:19:19ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/304514304514The 2-Pebbling Property of the Middle Graph of Fan GraphsYongsheng Ye0Fang Liu1Caixia Shi2School of Mathematical Sciences, Huaibei Normal University, Huaibei, Anhui 235000, ChinaSchool of Mathematical Sciences, Huaibei Normal University, Huaibei, Anhui 235000, ChinaSchool of Mathematical Sciences, Huaibei Normal University, Huaibei, Anhui 235000, ChinaA 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.http://dx.doi.org/10.1155/2014/304514 |
| spellingShingle | Yongsheng Ye Fang Liu Caixia Shi The 2-Pebbling Property of the Middle Graph of Fan Graphs Journal of Applied Mathematics |
| title | The 2-Pebbling Property of the Middle Graph of Fan Graphs |
| title_full | The 2-Pebbling Property of the Middle Graph of Fan Graphs |
| title_fullStr | The 2-Pebbling Property of the Middle Graph of Fan Graphs |
| title_full_unstemmed | The 2-Pebbling Property of the Middle Graph of Fan Graphs |
| title_short | The 2-Pebbling Property of the Middle Graph of Fan Graphs |
| title_sort | 2 pebbling property of the middle graph of fan graphs |
| url | http://dx.doi.org/10.1155/2014/304514 |
| work_keys_str_mv | AT yongshengye the2pebblingpropertyofthemiddlegraphoffangraphs AT fangliu the2pebblingpropertyofthemiddlegraphoffangraphs AT caixiashi the2pebblingpropertyofthemiddlegraphoffangraphs AT yongshengye 2pebblingpropertyofthemiddlegraphoffangraphs AT fangliu 2pebblingpropertyofthemiddlegraphoffangraphs AT caixiashi 2pebblingpropertyofthemiddlegraphoffangraphs |