Unpublished conference/Abstract (Scientific congresses and symposiums)
Constant 2-labelling of a graph
Gravier, Sylvain; Vandomme, Elise
2012Journées montoises d'informatique théorique
 

Files


Full Text
JM12_Gravier_Vandomme.pdf
Author preprint (279.62 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
codes; graph colouring; infinite grid
Abstract :
[en] We introduce the concept of constant 2-labelling of a weighted graph and show how it can be used to obtain periodic sphere packing. Roughly speaking, a constant 2-labelling of a weighted graph is a 2-coloring (black and white) of its vertex set which preserves the sum of the weight of black vertices under some automorphisms. In this manuscript, we study this problem on weighted complete graphs and on weighted cycles. Our results on cycles allow us to determine (r,a,b)-codes in Z^2 whenever |a-b|>4 and r>1.
Disciplines :
Mathematics
Author, co-author :
Gravier, Sylvain;  Université de Grenoble > Institut Fourier > Mathématiques Discrètes
Vandomme, Elise ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Constant 2-labelling of a graph
Publication date :
September 2012
Number of pages :
7
Event name :
Journées montoises d'informatique théorique
Event organizer :
R. Jungers
Event place :
Louvain-la-Neuve, Belgium
Event date :
from 11-9-2012 to 14-9-2012
Audience :
International
Available on ORBi :
since 27 November 2012

Statistics


Number of views
54 (5 by ULiège)
Number of downloads
35 (0 by ULiège)

Bibliography


Similar publications



Contact ORBi