Related papers: Completely symmetric configurations for sigma-game…
In this paper we give some two-dimensional and some three-dimensional examples for the shape of the symmetric solution set of a linear complementarity problem where the given data are not explicitly known but can only be enclosed in…
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver…
The exact complexity of solving parity games is a major open problem. Several authors have searched for efficient algorithms over specific classes of graphs. In particular, Obdr\v{z}\'{a}lek showed that for graphs of bounded tree-width or…
Lights Out is a game which can be played on any graph $G$. Initially we have a configuration which assigns one of the two states on or off to each vertex. The aim of the game is to turn all vertices to off state for an initial configuration…
In this paper we study a variant of the solitaire game Lights-Out, where the player's goal is to turn off a grid of lights. This variant is a two-player impartial game where the goal is to make the final valid move. This version is playable…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
A signed graph $\Sigma$ is a pair $(G,\sigma)$, where $G=(V,E)$ is the underlying graph in which each edge is assigned $+1$ or $-1$ by the signature function $\sigma:E\rightarrow\{-1,+1\}$. In this paper, we extend the extensively applied…
The total isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $S$ is the set of already played vertices, then a vertex can be selected only if it is adjacent to a vertex that belongs to a…
This paper introduces a new reconfiguration problem of matchings in a triangular grid graph. In this problem, we are given a nearly perfect matching in which each matching edge is labeled, and aim to transform it to a target matching by…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…
We formalize symmetry breaking as a set-covering problem. For the case of breaking symmetries on graphs, a permutation covers a graph if applying it to the graph yields a smaller graph in a given order. Canonical graphs are those that…
A general form for all supersymmetric solutions of minimal supergravity in six dimensions is obtained. Examples of new supersymmetric solutions are presented. It is proven that the only maximally supersymmetric solutions are flat space,…
Given a connected graph with domination (or total domination) number \gamma>=2, we ask for the maximum number m_\gamma and m_{\gamma,T} of dominating and total dominating sets of size \gamma. An exact answer is provided for \gamma=2and…
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
The geometry of (2,1) supersymmetric sigma-models is reviewed and the conditions under which they have isometry symmetries are analysed. Certain potentials are constructed that play an important role in the gauging of such symmetries. The…
In this paper we survey various notions of anonymity and symmetry for finite strategic-form games present in relevant literature, and discuss notions of fairness; show that game bijections and game isomorphisms form groupoids; introduce…
We show that a totally geodesic submanifold of a symmetric space satisfying certain conditions admits an extension to a minimal submanifold of dimension one higher, and we apply this result to construct new examples of complete embedded…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a…