𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance three labelings of trees

✍ Scribed by Jiří Fiala; Petr A. Golovach; Jan Kratochvíl; Bernard Lidický; Daniël Paulusma

Book ID
113564614
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
496 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex labelings of trees
Convex labelings of trees
✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T

Radio labelings of distance graphs
Radio labelings of distance graphs
✍ Čada, Roman; Ekstein, Jan; Holub, Přemysl; Togni, Olivier 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 423 KB
Bipartite labelings of trees and the gra
Bipartite labelings of trees and the gracesize
✍ Alexander Rosa; Jozef Širáň 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

## Abstract Let __T__ = (__V, E__) be a tree whose vertices are properly 2‐colored. A bipartite labeling of __T__ is a bijection __f__: __V__ ← {0, 1, ⃛, | __E__ |} for which there is a __k__ such that whenever __f__(__u__) ≤ __k__ < __f__(__v__), then __u__ and __v__ have different colors. The α‐s