Search arXivSearch

arXiv · 2411.18992

Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles

Abstract

An $L(2,1)$-labeling of a graph $G=(V,E)$ is a function $f$ from the vertex set $V(G)$ to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two, and the labels on vertices at distance two differ by at least one. The span of $f$ is the difference between the largest and the smallest numbers of $f(V)$. The $λ$-number of $G$, denoted by $λ(G)$, is the minimum span over all $L(2,1)$-labelings of $G$. We prove that if $X= C_m\boxtimes^{σ_\ell} C_{n}$ is a direct graph bundle with fiber $C_{n}$ and base $C_m$, $n$ is a multiple of 11 and $\ell$ has a form of $\ell =[11k+(-1)^a 4m]\mod n$ or of $\ell =[11k+(-1)^a 3m]\mod n$, where $a\in \{1,2\}$ and $k\in \ZZ$, then $λ(X)=10$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Irena Hrastnik Ladinek. 2024-11-28. Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles. https://arxiv.org/abs/2411.18992

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO