The 2-pebbling property of the middle graph of fan graphs (Q2336319): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pebbling in Hypercubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The 2-pebbling property and a conjecture of Graham's / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The \(t\)-pebbling number of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4386076 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pebbling number of squares of odd cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The pebbling number of squares of even cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pebbling numbers of some graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5399880 / rank | |||
Normal rank | |||
Latest revision as of 23:29, 20 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-pebbling property of the middle graph of fan graphs |
scientific article |
Statements
The 2-pebbling property of the middle graph of fan graphs (English)
0 references
19 November 2019
0 references
Summary: 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.
0 references
