Sep 26, 2011 · In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for ...
this event. We now define the guessing number of the graph via the winning p. robability in the. optimal strategy for that graph.
Sep 26, 2011 · The guessing game can be described as follows: Each vertex v of a, directed or undi- rected, graph G is assigned a player, also denoted by v, ...
Abstract. In [Rii07], Riis introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper ...
The linear guessing number of undirected graphs - ScienceDirect
www.sciencedirect.com › article › pii
May 15, 2014 · This paper investigates linear guessing number introduced by Riis in connection with the network coding theory.
People also ask
What is the total number of undirected graphs?
What is the hat guessing number of graphs?
What is the maximum number of undirected graph?
What is the number of edges in the undirected graph?
For s ∈ N and a graph G, let the guessing number be given as gn(G, s) = k, where k is the largest value such that there exists a protocol P where the ...
In this thesis, to better understand the nature of the guessing number of undirected graphs we apply the concept of saturation to guessing numbers.
Nov 10, 2021 · All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors ...
This paper establishes properties of linear guessing number on undirected graphs. In Section 2, a formula for calculating linear guessing number is obtained.
Oct 22, 2024 · The guessing number of a graph, G, is also studied for its relation to the information defect of G and index coding with side information [1,11] ...