The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 781 –
800 of
8549
Consider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games. Similarly, the well-known state-labeling algorithm used in model checking can be viewed as computing optimal paths on a Kripke structure, where each path has a minimum number of transitions. We exploit these similarities in a common generalization of extensive games and Kripke structures that we name “graph games”. By extending...
In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.
An algorithm is given to decompose an automorphism of a finite vector space over ℤ₂ into a product of transvections. The procedure uses partitions of the indexing set of a redundant base. With respect to tents, i.e. finite ℤ₂-representations generated by a redundant base, this is a decomposition into base changes.
A (finite) acyclic connected graph is called a tree. Let be a finite nonempty set, and let be the set of all trees with the property that is the vertex set of . We will find a one-to-one correspondence between and the set of all binary operations on which satisfy a certain set of three axioms (stated in this note).
Currently displaying 781 –
800 of
8549