✦ LIBER ✦

Skolem Graceful Signed Graphs

✍ Scribed by Mukti Acharya; Tarkeshwar Singh

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 128 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00508-6

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,

Skolem labelled graphs

✍ E. Mendelsohn; N. Shalaby 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 814 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

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