Personal tools

Achievable Pebbling Numbers

— filed under: ,

Aparna Higgins, University of Dayton

  • Graph Theory Seminar
  • Colloquium
When Fri, Apr 24, 2009
from 11:00 AM to 11:50 AM
Where RH 316
Add event to calendar vCal

Given a connected graph G and a distribution of non-negative integers on its vertices, a pebbling move on G is defined as the removal of two pebbles from one vertex, followed by the placement of one of those pebbles on an adjacent vertex.  The pebbling number f(G) of a graph is the minimum number of pebbles needed such that, given any distribution of f(G) pebbles on G, one pebble can be placed on any specified but arbitrary vertex through a sequence of pebbling moves.  It is known that for a graph G with n vertices, n ≤ f(G) ≤ 2^(n-1).  In this talk, I will describe our attempts to determine which of the integers in the interval [n, 2^(n-1) ] can be realized as the pebbling number of a graph on n vertices.   

« September 2017 »
Upcoming Events
Computer Science Seminar
Tue, Sep 26, 2017
An Introduction to Persistent Homology by David Letscher, SLU
Math/CS Club
Wed, Sep 27, 2017
Chasing the Sun Kevin Scannell, SLU
Algebra Seminar
Thu, Sep 28, 2017
An introduction to cluster superalgebras 4 Jimmy Mixco, Saint Louis University
Previous events…
Upcoming events…