A note on graph pebbling

Andrzej Czygrinow, Glenn Hurlbert, Henry Kierstead, William T. Trotter

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least k(d) is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must satisfy k(d) = 0(2d/d). In this note, we show that k exists and satisfies k(d) = O(22d). We also apply this result to improve the upper bound on the random graph threshold of the Class 0 property.

Original languageEnglish (US)
Pages (from-to)219-225
Number of pages7
JournalGraphs and Combinatorics
Volume18
Issue number2
DOIs
StatePublished - 2002

Fingerprint

Graph in graph theory
Integer
Random Graphs
Connectivity
Upper bound
Denote
Class

Keywords

  • Connectivity
  • Pebbling
  • Threshold

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

A note on graph pebbling. / Czygrinow, Andrzej; Hurlbert, Glenn; Kierstead, Henry; Trotter, William T.

In: Graphs and Combinatorics, Vol. 18, No. 2, 2002, p. 219-225.

Research output: Contribution to journalArticle

Czygrinow, Andrzej ; Hurlbert, Glenn ; Kierstead, Henry ; Trotter, William T. / A note on graph pebbling. In: Graphs and Combinatorics. 2002 ; Vol. 18, No. 2. pp. 219-225.
@article{8c8d38305e25456ba7f01186453c27ee,
title = "A note on graph pebbling",
abstract = "We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least k(d) is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must satisfy k(d) = 0(2d/d). In this note, we show that k exists and satisfies k(d) = O(22d). We also apply this result to improve the upper bound on the random graph threshold of the Class 0 property.",
keywords = "Connectivity, Pebbling, Threshold",
author = "Andrzej Czygrinow and Glenn Hurlbert and Henry Kierstead and Trotter, {William T.}",
year = "2002",
doi = "10.1007/s003730200015",
language = "English (US)",
volume = "18",
pages = "219--225",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "2",

}

TY - JOUR

T1 - A note on graph pebbling

AU - Czygrinow, Andrzej

AU - Hurlbert, Glenn

AU - Kierstead, Henry

AU - Trotter, William T.

PY - 2002

Y1 - 2002

N2 - We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least k(d) is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must satisfy k(d) = 0(2d/d). In this note, we show that k exists and satisfies k(d) = O(22d). We also apply this result to improve the upper bound on the random graph threshold of the Class 0 property.

AB - We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least k(d) is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must satisfy k(d) = 0(2d/d). In this note, we show that k exists and satisfies k(d) = O(22d). We also apply this result to improve the upper bound on the random graph threshold of the Class 0 property.

KW - Connectivity

KW - Pebbling

KW - Threshold

UR - http://www.scopus.com/inward/record.url?scp=0036910031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036910031&partnerID=8YFLogxK

U2 - 10.1007/s003730200015

DO - 10.1007/s003730200015

M3 - Article

VL - 18

SP - 219

EP - 225

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -