相关论文: Alphabet-Almost-Simple 2-Neighbour Transitive Code…

Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…

An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{X})$ where $G=(V,E)$ is a graph and $\mathcal{X}\subseteq {E \choose 2}$ is a set of pairs of its edges. The AT-graph $A$ is simply realizable if $G$ can be drawn…

Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. Let $d\in H_2(X)$ be a…

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

In this article, we study $2$-designs with prime replication number admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine $2$-designs with…

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…

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…

A simple undirected graph is weakly $G$-locally projective, for a group of automorphisms $G$, if for each vertex $x$, the stabiliser $G(x)$ induces on the set of vertices adjacent to $x$ a doubly transitive action with socle the projective…

Let $\text{Homeo}_{+}(\mathbb{S}^1)$ denote the group of orientation preserving homeomorphisms of the circle $\mathbb{S}^1$. A subgroup $G$ of $\text{Homeo}_{+}(\mathbb{S}^1)$ is tightly transitive if it is topologically transitive and no…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…

In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…

For a non-complete graph $\Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $u\neq w$ and $u,w$ are not adjacent. Then $\Gamma$ is said to be $2$-geodesic transitive if its automorphism…

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…