Kotte Amaranadha Reddy

• Vellore Institute of Technology University

A reverse edge magic (REM) labeling of a graph $ G(V, E) $ with $ p $ vertices and $ q $ edges is a bijection $ f:V\left(G \right)\cup E\left(G \right)\to \{1, 2, \cdot \cdot \cdot, p+q\} $ such that $ k = f\left(uv \right)-\{f\left(u \right)+f\left(v \right)\} $ is a constant $ k $ for any edge $ uv\in E\left(G \right). $ A REM labeling $ f $ is c...

In this paper investigate the critical set of reverse edge magic labeling on caterpillar graphs and application on secret sharing scheme. Here we construct a distribution scheme based on super visional secret sharing scheme. The schemes use the notion of critical sets to distribute the share and reconstruct the key. keywords: Caterpillar graph, sec...