Search arXivSearch

arXiv · 2206.02028

Equatorially balanced C4-face-magic labelings on Klein bottle grid graphs

Abstract

For a graph $G = (V, E)$ embedded in the Klein bottle, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a $C_k$-face-magic Klein bottle graph if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any $F \in \mathcal{F}(G)$ with $F \cong C_k$, the sum of all the vertex labelings along $C_k$ is a constant $S$. Let $x_v =f(v)$ for all $v\in V(G)$. We call $\{x_v : v\in V(G)\}$ a $C_k$-face-magic Klein bottle labeling on $G$. We consider the $m \times n$ grid graph, denoted by $\mathcal{K}_{m,n}$, embedded in the Klein bottle in the natural way. We show that for $m,n\ge 2$, $\mathcal{K}_{m,n}$ admits a $C_4$-face-magic Klein bottle labeling if and only if $n$ is even. We say that a $C_4$-face-magic Klein bottle labeling $\{x_{i,j}: (i,j) \in V(\mathcal{K}_{m,n}) \}$ on $\mathcal{K}_{m,n}$ is equatorially balanced if $x_{i,j} + x_{i,n+1-j} = \tfrac{1}{2} S$ for all $(i,j) \in V(\mathcal{K}_{m,n})$. We show that when $m$ is odd, a $C_4$-face-magic Klein bottle labeling on $\mathcal{K}_{m,n}$ must be equatorially balanced. Also when $m$ is odd, we show that (up to symmetries on the Klein bottle) the number of $C_4$-face-magic Klein bottle labelings on the $m \times 4$ Klein bottle grid graph is $2^m \, (m-1)! \, τ(m)$, where $τ(m)$ is the number of positive divisors of $m$. Furthermore, let $m\ge 3$ be an odd integer and $n \ge 6$ be an even integer. Then, the minimum number of distinct $C_4$-face-magic Klein bottle labelings $X$ on $\mathcal{K}_{m,n}$ (up to symmetries on a Klein bottle) is either $(5\cdot 2^m)(m-1)!$ if $n \equiv 0\pmod{4}$, or $(6\cdot 2^m)(m-1)!$ if $n \equiv 2\pmod{4}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen J. Curran, Richard M. Low, Stephen C. Locke. 2022-06-04. Equatorially balanced C4-face-magic labelings on Klein bottle grid graphs. https://arxiv.org/abs/2206.02028

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO