1. Introduction

Throughout this paper by a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G are denoted by V (G) and E(G) respectively. A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Terms and notations not defined here are used in the sense of Harary ((^{1})). There are several types of labeling. An excellent survey of graph labeling is maintained by Gallian ((^{2})). The notion of mean labeling was due to Somasundaram et al.((^{8})). A graph G = (V ,E) with p vertices and q edges is called a mean graph if there is an injective function ƒ that maps V (G) to
such that for each edge 𝒖𝒗 labeled with
is odd. Then the resulting edge labels are distinct. The concept of skolem difference mean labeling was introduced by Murugan et al.((^{4})) and they studied the skolem difference mean labeling of H-graphs. In ((^{3})), they studied skolem difference mean labeling of finite union of paths. Further, the skolem difference mean labeling of
were proved in ((^{5})). Ramya et al. ((^{6})), proved that
, where T is a Tp - tree, caterpillar, Sm,n and
were skolem difference mean graphs. In ((^{7})), we proved that the graphs
and Bt(n,n, …n) admit skolem difference mean labeling.

We use the following definitions in the subsequent section.

Definition 1.1. A graph G = (V ,E) with p vertices and 𝑞 edges is said to have skolem difference mean labeling if it is possible to label the vertices with distinct elements f (χ) from 1,2,3,…p + q in such a way that for each edge e = 𝒖𝒗, let f* (e) = is odd and the resulting labels of the edges are distinct and are from 1,2,3. …, q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph.

Definition 1.2. Let G1 and G2 be two graphs having vertex sets V1 and V2 and edge sets E1 and E2 respectively. Then their union G1 ∪ G2 has V = V1 ∪ V2 and E = E1 ∪ E2.

Definition 1.3. A path is a walk if all the vertices and edges are distinct. A path on 𝑛 vertices is denoted by Pn The graph mPn is the disjoint union of m copies of the path Pn

Definition 1.4. The wheel graph Wn is obtained by joining a central vertex to all vertices of the cycle Cn by an edge.

Definition 1.5. The fan graph 𝐹 𝑛 is obtained by joining a vertex to all vertices of the path Pn by an

2. Main results

In this section we prove that a skolem difference mean graphs.

Theorem 2.1. The union of two cycles is a skolem difference mean graph.

Proof Case(i). m is odd.

Let m = 2l + 1.

Subcase(i). 𝑛 is odd.

Let n = 2 k + 1

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, and hence f is a skolem difference mean labeling.

Subcase(ii). n is even.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, we get the edge labels are from . Hence f is a skolem difference mean labeling.

Case(ii). m is even.

Let m = 2I.

Subcase(i). n is odd.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, f is a skolem difference mean labeling.

Subcase(ii). n is even.

Therefore, f is a skolem difference mean labeling and hence Cm ∪ Cn is a skolem difference mean graph. The skolem difference mean labeling of C7 ∪ C8 and C9 ∪ C3 are shown in Figure 1 and Figure 2.

Theorem 2.2.The graph is a skolem difference mean graph.

Proof. Let
n - 2 be the vertices of (n - 2) K_{2} respectively.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, f is a skolem difference mean labeling of F_{n} ∪ (n - 2) K_{2} and hence F_{n} ∪ (n - 2) K_{2} (n ˃ 2) is a skolem difference mean graph.

A skolem difference mean labeling of F_{7} ∪ 5K_{2} is shown in Figure 3.

**Theorem 2.3.** The graph
is a skolem difference mean graph.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, f is a skolem difference mean labeling of
3) K_{2} and hence
is a skolem difference mean graph.

A skolem difference mean labeling of is shown in Figure 4.

**Theorem 2.4.** The graph
is a skolem difference mean graph.

**Proof.** Let
n - 1 ) be the vertices of n - 1 ) K_{2} respectively.

**
Case(i). n
** is odd.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, and hence f is a skolem difference mean labeling.

For each vertex label f, the induced edge label f* is calculated as follows:

Therefore, f is a skolem difference mean labeling and hence W_{n} (n - 1) K_{2} is a skolem difference mean graph.

A skolem difference mean labeling of W_{8} ∪ 7 K_{2} is shown in Figure 5.