ﻻ يوجد ملخص باللغة العربية
Let $G = (V,E)$ be a graph and let $r,s,k$ be positive integers. Revolutionaries and Spies, denoted $cG(G,r,s,k)$, is the following two-player game. The sets of positions for player 1 and player 2 are $V^r$ and $V^s$ respectively. Each coordinate in $p in V^r$ gives the location of a revolutionary in $G$. Similarly player 2 controls $s$ spies. We say $u, u in V(G)^n$ are adjacent, $u sim u$, if for all $1 leq i leq n$, $u_i = u_i$ or ${u_i,u_i} in E(G)$. In round 0 player 1 picks $p_0 in V^r$ and then player 2 picks $q_0 in V^s$. In each round $i geq 1$ player 1 moves to $p_i sim p_{i-1}$ and then player 2 moves to $q_i sim q_{i-1}$. Player 1 wins the game if he can place $k$ revolutionaries on a vertex $v$ in such a way that player 1 cannot place a spy on $v$ in his following move. Player 2 wins the game if he can prevent this outcome. Let $s(G,r,k)$ be the minimum $s$ such that player 2 can win $cG(G,r,s,k)$. We show that for $d geq 2$, $s(Z^d,r,2)geq 6 lfloor frac{r}{8} rfloor$. Here $a,b in Z^{d}$ with $a eq b$ are connected by an edge if and only if $|a_i - b_i| leq 1$ for all $i$ with $1 leq i leq d$.
We describe the first data release from the Spitzer-IRAC Equatorial Survey (SpIES); a large-area survey of 115 deg^2 in the Equatorial SDSS Stripe 82 field using Spitzer during its warm mission phase. SpIES was designed to probe sufficient volume to
We show that the class of trapezoid orders in which no trapezoid strictly contains any other trapezoid strictly contains the class of trapezoid orders in which every trapezoid can be drawn with unit area. This is different from the case of interval o
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.
Let $D$ be a strongly connected digraph. The average distance $bar{sigma}(v)$ of a vertex $v$ of $D$ is the arithmetic mean of the distances from $v$ to all other vertices of $D$. The remoteness $rho(D)$ and proximity $pi(D)$ of $D$ are the maximum a
We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our theorems a