L(p,1)-labelling of graphs - Université Paris Cité Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

L(p,1)-labelling of graphs

Bruce Reed
Jean-Sébastien Sereni
  • Fonction : Auteur
  • PersonId : 1026915
  • IdRef : 110354540

Résumé

An $L(p,1)$-labelling of a graph is a function $f$ from the vertex set to the positive integers such that $|f(x)-f(y)|\geq p$ if $\dist(x,y)=1$ and $|f(x)-f(y)|\geq p$ if $\dist(x,y)=2$, where $\dist(x,y)$ is the distance between the two vertices~$x$ and~$y$ in the graph. The \emph{span} of an $L(p,1)$-labelling $f$ is the difference between the largest and the smallest labels used by $f$ plus $1$. In 1992, Griggs and Yeh conjectured that every graph with maximum degree $\Delta\geq 2$ has an $L(2,1)$-labelling with span at most $\D^2+1$. We settle this conjecture for $\D$ sufficiently large. More generally, we show that for any positive integer $p$ there exists a constant $\Delta_p$ such that every graph with maximum degree $\Delta\geq \Delta_p$ has an $L(p,1)$-labelling with span at most $\D^2+1$. This yields that, for each positive integer $p$, there is an integer $C_p$ such that every graph with maximum degree $\Delta$ has an $L(p,1)$-labelling with span at most $\Delta^2+C_p$.
Fichier principal
Vignette du fichier
Lp1-inria.pdf (443.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00327909 , version 1 (09-10-2008)
inria-00327909 , version 2 (05-03-2012)

Identifiants

  • HAL Id : inria-00327909 , version 1

Citer

Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. L(p,1)-labelling of graphs. [Research Report] RR-6673, 2008. ⟨inria-00327909v1⟩

Collections

INRIA-RRRT
298 Consultations
346 Téléchargements

Partager

Gmail Facebook X LinkedIn More