๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Labeling trees with a condition at distance two

โœ Scribed by Tiaziana Calamoneri; Rossella Petreschi; Andrzej Pelc


Book ID
111716166
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
220 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Labeling matched sums with a condition a
โœ Sarah Spence Adams; Denise Sakai Troxell ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 267 KB

2, 1)-coloring Matched sum a b s t r a c t An L(2, 1)-labeling of a graph G is a function f x and y are adjacent vertices, and |f (x) -f (y)| โ‰ฅ 1 if x and y are at distance 2. Such labelings were introduced as a way of modeling the assignment of frequencies to transmitters operating in close proxim