In this paper further result on odd mean labeling is discussed. We prove that the two star G = K 1,m ∧ K 1,n is an odd mean graph if and only if |m − n| ≤ 3. The condition for a graph to be odd mean is that p ≤ q + 1, where p and q stands for the number of the vertices and edges in the graph respectively.

No abstract

In this paper, we prove if $r > s < t$, the four star $G=k_{1,r} \cup k_{1,r} \cup k_{1,s} \cup k_{1,t}$ is not a skolem mean graph if $\left|s-t\right| > 4 + 2r$ for $r = 2,3\cdots$; $s = 1,2\cdots$ and $t \geq 2r + s + 5$.

In this paper, we have found a technique for coding a secret messages by applying the even felicitous labeling on the two star graph K 1,φ ∪ K 1,ψ using GMJ (Graph Message Jumbled) code. We provided two illustrations for converting plain text into cipher text (picture coding) and method for labeling the felicitous graph is described.

In this paper we prove that the two star K1,g ∧ K 1,h is mean cordial graph if and only if |2g − h| ≤ 4 for g ≤ h and g = 1, 2, 3, • • • .