๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On skolem graceful graphs

โœ Scribed by S.M. Lee; S.C. Shee

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
471 KB
Volume
93
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 are calculated. The class of Skolem graceful graphs is shown to be finite universal.

๐Ÿ“œ SIMILAR VOLUMES

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,

Strongly graceful graphs
Strongly graceful graphs
โœ Maryvonne Maheo ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 731 KB

In this paper, we prove that the n-cube is graceful, thus answering a conjecture of J.-C. Bermond and Gangopadhyay and Rao Hebbare. To do that, we introduce a special kind of graceful numbering, particular case of a-valuation, called strongly graceful and we prove that if a graph G is strongly grace

Skolem labelled graphs
Skolem labelled graphs
โœ E. Mendelsohn; N. Shalaby ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 814 KB
Two sets of graceful graphs
Two sets of graceful graphs
โœ Charles Delorme ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 109 KB

We give graceful numberings to the following graphs: (a) the union of n K4 having one edge in common, in other words the join of K2 and the union of n disjoint K2 and (b) the union of n C4 having one edge in common, in other words the product of K2 and K,,", with n + l not a multiple of 4.