An improved upper bound for the pebbling threshold of the \(n\)-path (Q1420621): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2002.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975851722 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2784326 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Thresholds for families of multisets, with an application to graph pebbling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pebbling in Hypercubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On pebbling threshold functions for graph sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4949852 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An addition theorem on the integers modulo \(n\) / rank | |||
Normal rank | |||
Latest revision as of 14:31, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved upper bound for the pebbling threshold of the \(n\)-path |
scientific article |
Statements
An improved upper bound for the pebbling threshold of the \(n\)-path (English)
0 references
2 February 2004
0 references
Pebbling number
0 references
Pebbling threshold
0 references
\(n\)-Path
0 references
\(n\)-Cycle
0 references
