Resultado da Busca
8 de jul. de 2023 · PDF | The Edge-Sum Distinguishing game (ESD game) is a graph labeling game proposed by Tuza in 2017. In such a game, the players, traditionally called... | Find, read and cite all the...
Semantic Scholar extracted view of "On the edge-sum distinguishing game" by Deise L. de Oliveira et al. ... 10.7151/dmgt.2502; Corpus ID: 259899709; On the edge-sum ...
The Edge-Sum Distinguishing game (ESD game) is a type of maker-breaker game, where the players have opposite goals. In this game, Alice and Bob alternately assign a previously unused label f (v) ∈ L = {1, . . . , s} to an unlabeled vertex v of a given graph G.
Abstract. In 2017, Tuza introduced a graph labeling game called Edge-Sum Distinguishing Game (ESD Game). Two players, Alice and Bob, alternately assign an unused label f(v) ∈ {1, . . . , s} to an unlabeled vertex v of a graph G, and the induced edge label φ(uv) of an edge uv ∈ E(G) is given by φ(uv) = f(u) + f(v).
Bounds on the Edge-Sum Distinguishing Game. Authors: Deise L. de Oliveira, Danilo Artigas, Simone Dantas and Atílio G. Luiz. Download. On the pebbling numbers of ...
the game version of L(d,1)-labelings [8], another one considers the game version of neighbor-sum- distinguishing edge labelings [5] and, in a recent survey, Z. Tuza [26] surveys the area and proposes new labeling games such as the graceful game studied in this work.
1 de jul. de 2017 · A neighbour-sum-distinguishing edge-colouring of G is an edge colouring γ such that for every edge u v in G, σ γ (u) ≠ σ γ (v). The neighbour-sum-distinguishing edge-colouring game on G is the 2-player game defined as follows.
