Related papers: Multilattice graphs and perfect domination

We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing matching? We first address the case where the…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. The smallest size of an identifying code of $G$ is denoted $\gamma^{\text{ID}}(G)$.…

Let G_n = C_n square P_2 denote the prism (circular ladder) graph on 2n vertices. By encoding column configurations as cyclic words, domination is reduced to local Boolean constraints on adjacent factors. This framework yields explicit…

We construct two quantum error correction codes for pure SU(2) lattice gauge theory in the electric basis truncated at the electric flux $j_{\rm max}=1/2$, which are applicable on quasi-1D plaquette chains, 2D honeycomb and 3D triamond and…

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…

Generalizations of QCD in which the number of colors N is taken to infinity are characterized by profound mathematical properties, with far-reaching implications for fundamental problems and for phenomenological issues alike. In this…

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…

The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of…

Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such…

We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_1,\ldots,m_t$ if and only if $n$ is odd, $3\leq m_i\leq n$ for $i=1,\ldots,t$, and $m_1+\cdots+m_t=\binom n2$. We also show that the…

We study the large-scale geometry of graph braid groups $\mathbb{B}_n(\mathsf{\Gamma})$, viewed as the fundamental groups of discrete configuration spaces $UD_n(\mathsf{\Gamma})$, which are special cube complexes in the sense of…

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order $n$ is at most $\lceil \frac13 n \rceil$, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture…

Let $SGL_n(\mathbb{F}_2)$ be the set of all invertible $n\times n$ symmetric matrices over the binary field $\mathbb{F}_2$. Let $\Gamma_n$ be the graph with the vertex set $SGL_n(\mathbb{F}_2)$ where a pair of matrices $\{A,B\}$ form an…

Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

A graph {\it has cutwidth at most 2} if one can number its vertices by $1,\ldots n$ so that for every $i=1,\ldots,n-1$ there are at most 2 edges $(u,v)$ such that $u\le i<v$. A characterization of graphs having cutwidth at most 2 in terms…

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…