On Elegant Labelling and Magic Labelling of Large-Scale Graphs

Figure 2

(a) A tree admits a strongly c-elegant labelling. (b) Another tree admits a set-ordered strongly c-elegant labelling. (c) An example of Theorem 8 based on two graphs shown in 2a.

(a)

(b)

(c)