Related papers: Permutations with restricted movement

We consider the following matching-based routing problem. Initially, each vertex $v$ of a connected graph $G$ is occupied by a pebble which has a unique destination $\pi(v)$. In each round the pebbles across the edges of a selected matching…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly…

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

For any graph G = (V, E) and proportion $p\in(0,1]$, a set $S\subseteq V$ is a p-dominating set if $\frac{|N[S]|}{|V|}\geq p$. The $p$-domination number $\gamma_{p}(G)$ equals the minimum cardinality of a $p$-dominating set in G. For a…

For a given graph $G=(V,E)$ and permutation $\pi:V\mapsto V$ the prism $\pi G$ of $G$ is defined as follows: $V(\pi G)=V(G)\cup V(G')$, where $G'$ is a copy of $G$, and $E(\pi G)=E(G)\cup E(G')\cup M_{\pi}$, where $M_{\pi}=\{uv': u\in V(G),…

The notion of ends in an infinite graph $G$ might be modified if we consider them as equivalence classes of infinitely edge-connected rays, rather than equivalence classes of infinitely (vertex-)connected ones. This alternative definition…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

Consider a statistical physical model on the $d$-regular infinite tree $T_{d}$ described by a set of interactions $\Phi$. Let $\{G_{n}\}$ be a sequence of finite graphs with vertex sets $V_n$ that locally converge to $T_{d}$. From $\Phi$…

We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…

Let $G$ be a graph with vertex set $V(G)$, $f$ a permutation of $V(G)$. Define $\delta_f(G)=|d(x,y)-d(f(x),f(y))|$ and $\delta_f(G)=\Sigma\delta_f(x,y)$, where the sum is taken over all unordered pair $x$, $y$ of distinct vertices of $G$.…

In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…

A signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G) \to \{+,-\}$. A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) number of negative edges, counting repetitions. A…

Given a graph $G = (V, E)$, a set $S \subseteq V \cup E$ of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in $S$ happens to be adjacent or incident to a member of $S$. The mixed domination…

We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph $G=(V,E)$ is a complete edge-colored permutation graph if and…

Extremal properties of sparse graphs, randomly perturbed by the binomial random graph are considered. It is known that every $n$-vertex graph $G$ contains a complete minor of order $\Omega(n/\alpha(G))$. We prove that adding $\xi n$ random…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

Various algorithms have been proposed to enumerate all connected induced subgraphs of a graph $G=(V,E)$. As a variation we enumerate all "packings of connected sets", i.e. partitions $\Pi$ of $V$ with the property that each part of $\Pi$…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…