Просмотр кода страницы Pebbling number

'''Pebbling number''' --- фишечное число. 

The ''' pebbling number''' of a graph <math>G</math>, <math>f(G)</math>, is the least <math>m</math> such that,
however <math>m</math> are placed on the vertices of <math>G</math>, we can move a pebble to
any vertex by a sequence of moves, each move taking two pebbles off
one vertex and placing one on an adjacent vertex.

We say a graph satisfies the ''' 2-pebbling property''', if two pebbles
can be moved to any specified vertex, when the total starting number of
pebbles is <math>2f(G) - q + 1</math>, where <math>q</math> is the number of vertices with
at least one pebble.

A graph <math>G</math> without the 2-pebbling property is called a ''' Lemke graph'''.