✦ LIBER ✦

On the harmoniousness of dicyclic groups

✍ Scribed by Cheng-De Wang

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 223 KB
Volume: 120
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90580-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the R-sequenceability of dicyclic gro

On the R-sequenceability of dicyclic groups

✍ Chengde Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We give a sufficient condition for the R-sequenceability of the dicyclic group Qzn =gp{ a, b: a'" = e, b2 = a", ab = ba-' } of order 4n and give two specific constructions by which the condition can be met when (1) n = 4k or (2) n + 1 is a prime p say and -2 is a primitive root modulo p. We conjectu

On R*-sequenceability and symmetric harm

On R*-sequenceability and symmetric harmoniousness of groups

✍ Cheng-De Wang; Philip A. Leonard 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB

We introduce a special harmoniousness called symmetric harmoniousness of groups and extend the R\*-sequenceability of abelian groups to nonabelian groups. We prove that the direct product of an R\*-sequenceable group of even order with a symmetric harmonious group of odd order is R\*-sequenceable. E

On r*-sequenceability and symmetric harm

On r*-sequenceability and symmetric harmoniousness of groups. II

✍ Cheng-De Wang; Philip A. Leonard 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

In this paper we investigate symmetric harmoniousness of groups and connections of this concept to the R\*-sequenceability of groups. We prove that, under suitable assumptions, the direct product of a symmetric harmonious group with a group that is R\*-sequenceable is R\*-sequenceable; we discuss th

What is the smallest number of dicycles

What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?

✍ Nathaniel Dean 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 408 KB

A digraph D with n vertices is said to be decomposable into a set S of dicycles if every arc of D is contained in exactly one member of S. Counterexamples are given to the following conjectures which are generalizations of three well-known conjectures by G. Hajos, P. Erdos, and P. J. Kelly: (1) [B.

On the harmonious coloring of collection

On the harmonious coloring of collections of graphs

✍ John P. Georges 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 741 KB

## Abstract The hermonious coloring number of the graph __G, HC__(__G__), is the smallest number of colors needed to label the vertices of __G__ such that adjacent vertices received different colors and no two edges are incident with the same color pair. In this paper, we investigate the __HC__‐num

Harmony of the Witch

✍ O'Connor, K E 📂 Fiction 📅 2019 🌐 English ⚖ 106 KB 👁 2 views