Composite Labelling of Unary Operation of Comp Graph and 2-Tuple of Coconut Tree

Main Article Content

T. R. Manikandan, V. E. Sasikala


In this paper, we introduce the concept of composite labelling. All the graphs considered are undirected connected simple graphs with order n and size m. Let u, v, w ∈ V(G). A composite labelling is a bijective function f: (V(G) ∪ E(G)) → {1, 2, 3, ..., m + n} such that gcd(f(uv), f(vw)) ̸= 1. A graph that admits composite labelling is known as a composite graph. In this paper we investigate composite labelling for unary operation of comp graph and splitting graph.

Article Details