✦ LIBER ✦

Graceful Signed Graphs

✍ Scribed by Mukti Acharya; Tarkeshwar Singh

Book ID: 111577421
Publisher: Springer
Year: 2004
Tongue: English
Weight: 237 KB
Volume: 54
Category: Article
ISSN: 0011-4642
DOI: 10.1023/b:cmaj.0000042369.18091.15

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Skolem Graceful Signed Graphs

✍ Mukti Acharya; Tarkeshwar Singh 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 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

Node-graceful graphs

✍ Frank Harary; D.Frank Hsu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 522 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

Signed degree sequences of signed graphs

✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

Balancing signed graphs

✍ J. Akiyama; D. Avis; V. Chvátal; H. Era 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 416 KB