Saved in:
Bibliographic Details
Main Author: Ladinek, Irena Hrastnik
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2411.18992
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913590062088192
author Ladinek, Irena Hrastnik
author_facet Ladinek, Irena Hrastnik
contents 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$.
format Preprint
id arxiv_https___arxiv_org_abs_2411_18992
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles
Ladinek, Irena Hrastnik
Combinatorics
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$.
title Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles
topic Combinatorics
url https://arxiv.org/abs/2411.18992