Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Robert A. Beeler"'
Publikováno v:
Discrete Applied Mathematics. 283:133-141
Let G be a connected simple graph with vertex set V and a distribution of pebbles on the vertices of V . The total domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28cc50579aa9c383b9a0b0c9e1601d80
https://doi.org/10.1016/j.dam.2019.12.020
https://doi.org/10.1016/j.dam.2019.12.020
Autor:
Robert A. Beeler, Aaron D. Gray
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783031053740
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dcf563b14ed876df385b34e703176ab
https://doi.org/10.1007/978-3-031-05375-7_12
https://doi.org/10.1007/978-3-031-05375-7_12
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 575-588 (2019)
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1d1e7c06d20fb58a047795ac4106305
https://doaj.org/article/8356c4f794c44b2f8ae1c2bb70002fb8
https://doaj.org/article/8356c4f794c44b2f8ae1c2bb70002fb8
Publikováno v:
Discrete Applied Mathematics. 260:75-85
Let G be a connected simple graph with vertex set V and a distribution of pebbles on V . The domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that after a sequence of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2983901ee08a1fd690ea8ef08df6ce9
https://doi.org/10.1016/j.dam.2019.01.037
https://doi.org/10.1016/j.dam.2019.01.037
Publikováno v:
The Art of Discrete and Applied Mathematics. 5:#P2.08
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e39f2cc53ee0949742fa02434aacc28
https://doi.org/10.26493/2590-9770.1344.20c
https://doi.org/10.26493/2590-9770.1344.20c
Publikováno v:
Mathematics Magazine. 89:252-261
Instant Insanity II is a 4 by 4 sliding tile puzzle designed by Philip Orbanes. The packaging indicates that there is a unique solution to the puzzle, up to rotations of the columns and permutation...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b1ff22464101b0ea95b930588e260a8
https://doi.org/10.4169/math.mag.89.4.252
https://doi.org/10.4169/math.mag.89.4.252
Publikováno v:
Discrete Applied Mathematics. 211:23-29
For a graph G = ( V , E ) , a double Roman dominating function is a function f : V ź { 0 , 1 , 2 , 3 } having the property that if f ( v ) = 0 , then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f ( w ) = 3 , and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a42cc261c4f29219ca442d5fc5f392a
https://doi.org/10.1016/j.dam.2016.03.017
https://doi.org/10.1016/j.dam.2016.03.017
Autor:
Robert A. Beeler
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and
Autor:
Robert A. Beeler, D. Paul Hoilman
Publikováno v:
Discrete Mathematics. 311:2198-2202
There have been several papers on the subject of traditional peg solitaire on different boards. However, in this paper we consider a generalization of the game to arbitrary boards. These boards are treated as graphs in the combinatorial sense. We pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::871cfcbe3731d8b9b84fed696561171b
https://doi.org/10.1016/j.disc.2011.07.006
https://doi.org/10.1016/j.disc.2011.07.006
Autor:
Robert E. Jamison, Robert A. Beeler
Publikováno v:
Graphs and Combinatorics. 27:149-160
A decomposition $${\fancyscript {D}}$$ of a graph H by a graph G is a partition of the edge set of H such that the subgraph induced by the edges in each part of the partition is isomorphic to G. The intersection graph $${I(\fancyscript {D})}$$ of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14e040391a5eca9011d0acf0e5d5b1ba
https://doi.org/10.1007/s00373-010-0981-2
https://doi.org/10.1007/s00373-010-0981-2