✦ LIBER ✦

Harmonious labelings of windmill graphs and related graphs

✍ Scribed by D. Frank Hsu

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 115 KB
Volume: 6
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190060110

No coin nor oath required. For personal study only.

✦ Synopsis

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 harmonious and so harmonious by drawing on partitions already available from the construction of cyclic neofields. Other irregular windmill graphs can be shown to be strongly harmonious in a similar way.

📜 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

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 the Complexity of Recognizing Hamming

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Graph labeling and radio channel assignm

Graph labeling and radio channel assignment

✍ van den Heuvel, J.; Leese, R. A.; Shepherd, M. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, e

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Antimagic labelling of vertex weighted g

Antimagic labelling of vertex weighted graphs

✍ Tsai-Lien Wong; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Suppose __G__ is a graph, __k__ is a non‐negative integer. We say __G__ is __k__‐antimagic if there is an injection __f__: __E__→{1, 2, …, |__E__| + __k__} such that for any two distinct vertices __u__ and __v__, . We say __G__ is weighted‐__k__‐antimagic if for any vertex weight functi