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

On critical trees labeled with a condition at distance two

โœ Scribed by Denise Sakai Troxell

Book ID
108113536
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
277 KB
Volume
295
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the size of graphs labeled with a con
On the size of graphs labeled with a condition at distance two
โœ Georges, John P.; Mauro, David W. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 595 KB

A labeling of graph G with a condition at distance two is an integer labeling of V(G) such that adjacent vertices have labels that differ by at least two, and vertices distance two apart have labels that differ by a t least one. The lambda-number of G, A(G), is the minimum span over all labelings of

Labeling matched sums with a condition a
Labeling matched sums with a condition at distance two
โœ 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