Reference : Constant 2-labelling of a graph

	Document type :	Scientific congresses and symposiums : Unpublished conference
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/2268/135175

Title :	Constant 2-labelling of a graph
Language :	English
Author, co-author :	Gravier, Sylvain [Université de Grenoble > Institut Fourier > Mathématiques Discrètes > >]
	Vandomme, Elise [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Publication date :	Sep-2012
Page number :	7
On invitation :	No
Audience :	International
Event name :	Journées montoises d'informatique théorique
Event date :	from 11-9-2012 to 14-9-2012
Event organizer :	R. Jungers
Event place (city) :	Louvain-la-Neuve
Event country :	Belgique
Keywords :	[en] 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.
Target :	Researchers
Permalink :	http://hdl.handle.net/2268/135175

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access JM12_Gravier_Vandomme.pdf Author preprint 273.07 kB View/Open

All documents in ORBi are protected by a user license.

 

© ULg Library Network |  Feedback |  ORBi legal notices

Dspace v1.5