Simply Sequentially Additive Labeling of Some Special Trees

6514 K. Manimekalai, J. Baskar Babujee and K. Thirusangu
For example, SSA-labeling of B(6, 6, 6, 6) is shown in Fig.10.
21
References
17
30 19
23
38 32
40
46 48
54
56
42
50
[1] D.W. Bange, A.E. Barkauskas and P.J. Slater, Sequentially additive graphs,
Discrete Math., 44 (1983), 235−241.
[2] J.A. Gallian, A Dynamic Survey of Graph Labeling, Electronic Journal of
Combinatorics, 17 (2010), # DS6.
[3] F.Harary, Graphy Theory, Addison Wesley, Reading, Massachusetts, 1969.
[4] S.M. Hegde and M. Miller, Further results on sequentially additive graphs,
Discussiones Mathematicae Graph Theory, 27 (2007), 251−268.
Received: August, 2012
34
29
45
37 25 16
53
2
26
3
22
13
43 35 27
20
51
47 39 31 24 12
55
8
52
44
36
57 49
41
33
28
4
15 10
5
11
6
Fig. 10: SSA-labeling of BT(6,6,6,6)
1