Publications

Abstract : Let G (V, E) be a simple, finite, connected graph on n vertices. Let f: V (G)→{1,2……… n} be an injective mapping. Then the largest cardinality of a set S⊆ V (G) such that for every pair of distinct vertices is called the radio secure number of f denoted by . The set S is called a radio secure set. The radio secure number of a graph G is defined as maximum value of over all such functions f and is denoted by . It is obvious that . If , then G is a radio graceful graph. In this paper, we investigate the radio secure number of certain standard graphs like complete graphs, complete bipartite graphs, wheels, paths and cycles