✦ LIBER ✦

Pair Labelings of Graphs

✍ Scribed by Guichard, David R.; Krussel, John W.

Book ID: 118199384
Publisher: Society for Industrial and Applied Mathematics
Year: 1992
Tongue: English
Weight: 783 KB
Volume: 5
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0405012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Maximum gap labelings of graphs

✍ Tomás Feder; Carlos Subi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 144 KB

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

On Partitional Labelings of Graphs

✍ Rikio Ichishima; Akito Oshima 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 191 KB

Irregular labelings of circulant graphs

✍ Marcin Anholcer; Cory Palmer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 204 KB

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