Construction of additively graceful signed graphs-I

Abstract

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful signed graphs. We find the values of m, n in non-divisible sum graph, denoted as G(m, n), that admit additively graceful labeling.

Figures (10)

• Figure 1:
• Figure 2:
• Figure 3:
• Figure 4:
• Figure 5: Left: a Middle: b Right: c

Theorems & Definitions (19)

• Definition 1.1
• Definition 1.2
• Definition 1.3
• Theorem 1.4
• Definition 1.5
• Definition 1.6
• Definition 1.7
• Theorem 2.1
• proof
• Theorem 2.2