Reference : Constant 2-labelling of a graph
Scientific congresses and symposiums : Unpublished conference
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/2268/135175
Constant 2-labelling of a graph
English
Gravier, Sylvain mailto [Université de Grenoble > Institut Fourier > Mathématiques Discrètes > >]
Vandomme, Elise mailto [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Sep-2012
7
Yes
No
International
Journées montoises d'informatique théorique
from 11-9-2012 to 14-9-2012
R. Jungers
Louvain-la-Neuve
Belgique
[en] codes ; graph colouring ; infinite grid
[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.
Researchers
http://hdl.handle.net/2268/135175

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
JM12_Gravier_Vandomme.pdfAuthor preprint273.07 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.