In this paper,using GMJ(Graph Message Jumbled) code, we developed a technique for coding a confidential message by applying the even felicitous labeling to the bistar graph Bv>0j.We presented two illustrations for transfering plain text into cipher text(picture coding), method for labeling an even felicitous graph and flowchart is outlined.

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$.

No abstract

No abstract