𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum gap labelings of graphs

✍ Scribed by Tomás Feder; Carlos Subi

Book ID
108154736
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
144 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Group labelings of graphs
Group labelings of graphs
✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such

Pair Labelings of Graphs
Pair Labelings of Graphs
✍ Guichard, David R.; Krussel, John W. 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 783 KB
On sequential labelings of graphs
On sequential labelings of graphs
✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

Harmonious labelings of windmill graphs
Harmonious labelings of windmill graphs and related graphs
✍ D. Frank Hsu 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ ≥ 1, __K__^(__t__^)~__n__~ is strongly