✦ LIBER ✦

Strongly graceful graphs

✍ Scribed by Maryvonne Maheo

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 731 KB
Volume: 29
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90285-p

No coin nor oath required. For personal study only.

✦ Synopsis

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 graceful, G + K, is also strongly graceful.

Dans cet article, nous prouvons que le n-cube est gracieux, rgpondant ainsi g une conjecture de J.-C. Bermond et Gangopadhyay et Rao Hebbare. Pour cela, nous introduisons la classe des graphes "fortement gracieux", cas particulier des a-valuations et nous prouvons que, si un graphe G est fortement g;racieux, alors G + K2 est aussi fortement gracieux.

📜 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

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 k-graceful, countably infinite graphs

✍ Peter J Slater 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 718 KB

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 indexable graphs

✍ B.D. Acharya; S.M. Hegde 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Acharya, B.D. and S.M. Hegde, Strongly indexable graphs, Discrete Mathematics 93 (1991) 123-129. A (p, q)-graph G = (V, E) is said to be strongly k-indexable if it admits a strong k-indexer viz., an injective function f : V -{C, 1, 2, . . . , p -1) such that f(x)+f(y)=f+(xy)Ef+(E)={k,k+l,k+2,.. . ,

Strongly balanced graphs and random grap

Strongly balanced graphs and random graphs

✍ Andrzej Ruciński; Andrew Vince 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 455 KB

The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with u vertices and e edges if and only if I s u -1 s e s ( 2 " ) . This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices