𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Labelings of two classes of plane graphs

✍ Scribed by Bača Martin


Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1993
Tongue
English
Weight
197 KB
Volume
9
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Superd-antimagic labelings of disconnect
✍ Martin Bača; Mirka Miller; Oudone Phanalasy; Andrea Semaničová-Feňovčíková 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 208 KB
Labelings of plane graphs containing Ham
✍ Martin Bača; Ljiljana Brankovic; Andrea Semaničová-Feňovčíková 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 353 KB
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

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 Consecutive labeling of plane graphs
✍ Martin Bac̆a 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 219 KB

This paper concerns a labeling problem of the plane graphs P,,. The present paper describes a nqic vertex labeling and a consecutive labeling ef type (0, I, I). These labelings combine to a consecutice labeling qf type (I, I, I).

Harmonious labelings of windmill 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