Optimal pebbling number of graphs with given minimum degree (Q1741506)
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 7050994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal pebbling number of graphs with given minimum degree |
scientific article; zbMATH DE number 7050994 |
Statements
Optimal pebbling number of graphs with given minimum degree (English)
0 references
3 May 2019
0 references
graph pebbling
0 references
optimal pebbling
0 references
given minimum degree
0 references
0.9057515263557434
0 references
0.8785438537597656
0 references
0.8600462079048157
0 references
0.8514419198036194
0 references
0.8475496768951416
0 references
