✦ LIBER ✦

Skolem labelled graphs

✍ Scribed by E. Mendelsohn; N. Shalaby

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 814 KB
Volume: 97
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90446-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On skolem graceful graphs

✍ S.M. Lee; S.C. Shee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Lee, S.M. and SC. Shee, On Skolem graceful graphs, Discrete Mathematics 93 (1991) 195-200. A Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem graceful iff it is graceful. The Skolem deficiency of a graph is defined and Skolem deficiencies of some well-known graphs

Graceful 2-regular graphs and Skolem seq

Graceful 2-regular graphs and Skolem sequences

✍ Jaromir Abrham 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 666 KB

The purpose of the paper is to study relations graphs and certain Skolem sequences. ## between graceful numbering of certain 2-regular In this paper, all graphs will be finite, without loops or multiple edges. For any graph G, the symbols V(G) and E(G) will denote its vertex set and its edge set,

Evacuation of labelled graphs

✍ Claudia Malvenuto; Christophe Reutenauer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 338 KB

In this note, we extend Schiitzenberger's evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged.

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 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

Extended skolem sequences

✍ C. A. Baker 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 671 KB

A k-extended Skolem sequence of order n is an integer sequence (s,, s2,. . . , S Z ~+ ~) in which sk = 0 and for eachj E (1,. . . ,n}, there exists a unique i E (1,. . . ,2n} such that si = s i + j = j . We show that such a sequence exists if and only if either 1) k is odd and n = 0 or 1 (mod 4) or