Search arXiv⌕ Search

arXiv · 2611.00893

On subgroup perfect codes and regular sets in generalized Cayley graphs

Abstract

A subset $C$ of the vertex set of a graph $Γ$ is said to be an $(a,b)$-regular set if $C$ induces an $a$-regular subgraph and every vertex outside $C$ is adjacent to exactly $b$ vertices in $C$. A $(0,1)$-regular set is called a perfect code. Let $G$ be a finite group and let $α\in\operatorname{Aut}(G)$ be such that $α^2=\mathrm{id}$. Let $ω_α(G)=\{α(g^{-1})g:g\in G\}$. For a subset $S\subseteq G$ satisfying $α(S)=S^{-1}$ and $S\capω_α(G)=\emptyset$, the generalized Cayley graph of $(G,α)$ with respect to $S$ is the graph with vertex set $G$ in which two distinct elements $g,h\in G$ are adjacent if and only if $α(g^{-1})h\in S$. In this paper, we prove two main results. First, let $H$ be an $α$-invariant subgroup of a finite group $G$, and let $P$ be an $α$-invariant Sylow 2-subgroup of $H$. We show that $H$ is a perfect code of $(G,α)$ if and only if $P[H,α]$ is a perfect code of $(G,α)$, where $[H,α]=\langle h^{-1}α(h):h\in H\rangle$. Second, we consider finite groups $G$ possessing a cyclic subgroup $A$ of index 2 that is invariant under an involutory automorphism $α$. We show that $ω_α(G)$ is a subgroup of $A$. Using this result, we give a complete characterization of all pairs $(a,b)$ for which an $α$-invariant subgroup $H$ of $G$ is an $(a,b)$-regular set of $(G,α)$. In particular, our characterization applies to all finite groups possessing a characteristic cyclic subgroup of index 2, for every involutory automorphism $α$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yasamin Khaefi, Fateme Sadat Seiedali. 2026-10-31. On subgroup perfect codes and regular sets in generalized Cayley graphs. https://arxiv.org/abs/2611.00893

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Connected Dominating Sets in Triangulations

A dominating set of a graph $G$ is \emph{connected} if it induces a connected graph in $G$. For planar triangulations, it has been known since 1990 that every $n$-vertex triangulation with $n\ge4$ admits a connected dominating set of size at most $n/2 - 1$, and no improvement to this bound was known for over three decades. We break this longstanding barrier by showing that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every triangulation admits a spanning tree with at least $11n/21$ leaves. This result has graph drawing applications, establishing a bound for one-bend free sets and improving the known bound for simultaneous planar embeddings. The connected dominating set results extend readily to show that an $n$-vertex triangulation of a surface of Euler genus $g$ has a connected dominating set of size at most $10n/21+O(\sqrt{gn})$.

math.CO↗

Curves on the torus with few intersections

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$. We determine the maximum size of such a set for every k. In particular, the maximum never exceeds k+6, and it does not exceed k+4 when k is large. As this quantity coincides with the maximal number of columns of a generic k-modular matrix with two rows, our result also settles the column number problem, a problem of interest in combinatorial optimization, for such matrices.

math.CO↗

Spectral extrema on closed surfaces of fixed Euler genus

We investigate a classical extremal problem in combinatorics and topological graph theory: determining the maximum spectral radius $spex(n,γ)$ of all $n$-vertex graphs embeddable on a closed surface of Euler genus $γ$. Building on seminal contributions by Boots and Royle, Cao and Vince, and Hong in the 1990s; Ellingham and Zha in 2000; Dvořák and Mohar in 2010; Tait and Tobin in 2017; and Liu, Ning, and Wang in 2026, we provide a complete characterization of spectral extremal graphs for any fixed Euler genus $γ$ and all sufficiently large $n$. The extremal graph attaining $\operatorname{spex}(n,γ)$ is unique, necessarily edge-extremal, and, roughly speaking, is constructed from the join $K_2 \nabla P_{n-2}$ by adding exactly $3γ$ edges. As a consequence, we derive asymptotically tight estimates for $\operatorname{spex}(n,γ)$, strengthening a classical bound due to Ellingham and Zha [J. Combin. Theory B, 2000]. We further characterize the extremal structures for the projective plane and torus, sharpening earlier bounds of Hong [J. Combin. Theory B, 1995]. For the planar case, we establish an explicit vertex threshold of $4.5\times 10^6$ for the Tait--Tobin theorem. Our approach combines extremal constructions of cellular embeddings, topological edge-switching techniques, and walk-counting estimates for large-scale substructures, revealing a bridge between spectral extremality and surface topology.

math.CO↗