Related papers: Leaper graphs
A leaper is a chess piece which generalises the knight. Given $n$ and a $(p, q)$-leaper $L$, we study the greatest $m$ such that the $m \times m$ grid graph can be embedded into the $n \times n$ leaper graph of $L$. We can assume that $p$…
A $(p, q)$-leaper is a fairy chess piece that, from a square $a$, can move to any of the squares $a + (\pm p, \pm q)$ or $a + (\pm q, \pm p)$. Let $L$ be a $(p, q)$-leaper with $p + q$ odd and $C$ a cycle of $L$ within a $(p + q) \times (p…
Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…
A leaper framework is a bar-and-joint framework whose joints are integer points forming a rectangular grid and whose bars correspond to all moves of a given leaper within that grid. We study the flexibility and rigidity of leaper…
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the…
Chess graphs encode the moves that a particular chess piece can make on an $m\times n$ chessboard. We study through these graphs through the lens of chip-firing games and graph gonality. We provide upper and lower bounds for the gonality of…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph…
A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder…
Two boards are rook equivalent if they have the same number of non-attacking rook placements for any number of rooks. Define a rook equivalence graph of an equivalence set of Ferrers boards by specifying that two boards are connected by an…
The $r$-flip-width of a graph, for $r\in \mathbb{N}\cup \{\infty\}$, is a graph parameter defined in terms of a variant of the cops and robber game, called the flipper game, and it was introduced by Toru\'{n}czyk (FOCS 2023). We prove that…
Shanks's sequence of quadratic fields $\Q(\sqrt{S_{n}})$ where $S_{n}=(2^n+1)^2 + 2^{n+2}$ instances a class of quadratic fields for which the class number is large and, therefore, the continued fraction period is relatively short. Indeed,…
A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the…
A rectilinear drawing of a graph is a drawing of the graph in the plane in which the edges are drawn as straight-line segments. The rectilinear crossing number of a graph is the minimum number of pairs of edges that cross over all…
Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $s,t$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We present an algorithm for…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
We study a game on a graph $G$ played by $r$ {\it revolutionaries} and $s$ {\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each revolutionary may move to a neighboring vertex or not move,…
Cops and Robbers is a game played on a graph where a set of cops attempt to capture a single robber. The game proceeds in rounds, where each round first consists of the cops' turn, followed by the robber's turn. In the cops' turn, every cop…
In the cops and robber games played on a simple graph $G$, Aigner and Fromme's lemma states that one cop can guard a shortest path in the sense that the robber cannot enter this path without getting caught after finitely many steps. In this…
The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-stab}(n, k)$ is obtained from the Kneser graph by deleting vertices with…