✦ LIBER ✦

Node-graceful graphs

✍ Scribed by Frank Harary; D.Frank Hsu

Book ID: 108020305
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 522 KB
Volume: 15
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(88)90214-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graceful Signed Graphs

✍ Mukti Acharya; Tarkeshwar Singh 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 237 KB

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 Graceful Signed Graphs

✍ Mukti Acharya; Tarkeshwar Singh 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

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

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.

On Modular Edge-Graceful Graphs

✍ Futaba Fujie-Okamoto, Ryan Jones, Kyle Kolasinski, Ping Zhang 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 338 KB