Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Papp, László F."'
Autor:
Papp, László F.
Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence of pebbling
Externí odkaz:
http://arxiv.org/abs/2301.09867
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal pebbling numb
Externí odkaz:
http://arxiv.org/abs/1810.05266
Consider a distribution of pebbles on a connected graph $G$. A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a pebbling distribution if it has a pebble after the application of a seq
Externí odkaz:
http://arxiv.org/abs/1804.03717
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal pebbling numb
Externí odkaz:
http://arxiv.org/abs/1708.09177
Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The optimal pebbling number of G is the smallest number of pebbles which c
Externí odkaz:
http://arxiv.org/abs/1611.09686
Publikováno v:
Periodica Polytechnica-electrical Engineering and Computer Science 61: (2) pp. 217-223. (2017)
In [C. Xue, C. Yerger: Optimal Pebbling on Grids, Graphs and Combinatorics] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distribution, then the covering ratio of this distribution is at most $3.25$
Externí odkaz:
http://arxiv.org/abs/1601.02229
Autor:
Katona, Gyula Y., Papp, László F.
Publikováno v:
Discrete Applied Mathematics 209: Pp. 227-246. (2016)
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and $w$ adjacent
Externí odkaz:
http://arxiv.org/abs/1411.0923
Publikováno v:
In Discrete Applied Mathematics 15 August 2019 266:340-345
Publikováno v:
In Discrete Mathematics July 2019 342(7):2148-2157