✦ LIBER ✦

Relating path coverings to vertex labellings with a condition at distance two

✍ Scribed by John P. Georges; David W. Mauro; Marshall A. Whittlesey

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 592 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0098-o

No coin nor oath required. For personal study only.

✦ Synopsis

A blabelling of graph G is an integer labelling 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 at least one. The 1 number of G, I(G), is the minimum span of labels over all such labellings. Griggs and Yeh have studied the relationship between I(G) and graph invariants x(G) and d(G). In this paper, we derive the relationship between A(G) and another graph invariant, the path covering number of G'. Applications include the determination of the i-number of the join of two graphs, the product of two complete graphs, and the complete multi-partite graphs.

📜 SIMILAR VOLUMES

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

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