2-pebbling property of butterfly-derived graphs (Q2113781)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7488823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-pebbling property of butterfly-derived graphs |
scientific article; zbMATH DE number 7488823 |
Statements
2-pebbling property of butterfly-derived graphs (English)
0 references
14 March 2022
0 references
Summary: For a graph \(G\), \(f(G)\) is the least distribution of \(p\) pebbles on the vertices of \(G\), so that we can move a pebble to any vertex by a sequence of moves and each move is taking two pebbles off one vertex and placing one pebble on an adjacent vertex. A graph \(G\) is said to satisfy 2-pebbling property, if it is possible to move two pebbles to any arbitrarily chosen vertex with a possible distribution of \(2f(G) - q + 1\) pebbles, where \(q\) is the number of vertices with at least one pebble. This paper determines the pebbling number and the 2-pebbling property of butterfly derived graphs.
0 references
pebbling
0 references
2-pebbling
0 references
butterfly graph
0 references
benes graph
0 references
augmented butterfly graph
0 references
enhanced butterfly graph
0 references
0.8736587166786194
0 references
0.8469821214675903
0 references
0.8428181409835815
0 references
