✦ LIBER ✦

Labeling trees with a condition at distance two

✍ Scribed by Tiziana Calamoneri; Andrzej Pelc; Rossella Petreschi

Book ID: 108113552
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 180 KB
Volume: 306
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.04.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On critical trees labeled with a conditi

On critical trees labeled with a condition at distance two

✍ Denise Sakai Troxell 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 277 KB

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

A survey on labeling graphs with a condi

A survey on labeling graphs with a condition at distance two

✍ Roger K. Yeh 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Labelling of some planar graphs with a c

Labelling of some planar graphs with a condition at distance two

✍ Sumei Zhang; Qiaoling Ma 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 180 KB

On island sequences of labelings with a

On island sequences of labelings with a condition at distance two

✍ Sarah Spence Adams; Alex Trazkovich; Denise Sakai Troxell; Bradford Westgate 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 654 KB

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