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...
Aα-spectral properties of some families of graphs with vertex connectivity equal to 1. Authors: Victor M. X. Leal, Carla S. Oliveira and André E. Brondani. Download.
Deise L. de Oliveira, Danilo Artigas, +1 author A. G. Luiz; Published 2023; Mathematics; Discussiones Mathematicae Graph Theory
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 vof a graph G, and the induced edge label ϕ(uv) of an edge uv∈E(G) is given by ϕ(uv) = f(u) + f(v). Alice’s goal
1 de jan. de 2023 · In this paper we study the neighbour-sum-distinguishing edge-colouring game on various classes of graphs. In particular, we prove that Bob wins the game on the complete graph Kn, n≥3,...
g(uv) = f(u) + f(v), então a rotulação é chamada de Edge-Sum Distinguishing (ESD). Uma outra maneira de abordar o tema de rotulação é através de jogos combinatórios.
