University of TehranJournal of Algorithms and Computation2476-277645120141115Skolem Odd Difference Mean Graphs1127916ENP.JeyanthiPrincipal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIAD.RamyaDepartment of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.R.KalaiyarasiDepartment of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.Journal Article20140726In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} denoted by f*(e) =|f(u)−f(v)|/2 is a bijection. A graph that admits skolem odd difference mean labeling is called odd difference mean graph. We call skolem odd difference mean labeling as skolem even vertex odd difference mean labeling if all the vertex labels are even.University of TehranJournal of Algorithms and Computation2476-277645120141115Three Graceful Operations13247917ENSarahMinionDepartment of Mathematics, Clayton State University, Morrow, Georgia 30260, USAChristianBarrientosDepartment of Mathematics, Clayton State University, Morrow, Georgia 30260, USAJournal Article20140726A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G and Pm, where G is a special type of graceful graph named - graph. Moreover, the majority of the graceful labelings obtained here correspond to the most restrictive kind, they are -labelings. These labelings are in the core of this research area due to the fact that they can be used to create other types of graph labelings, almost independently of the nature of these labelings.University of TehranJournal of Algorithms and Computation2476-277645120141120Edge pair sum labeling of spider graph25347918ENP.JeyanthiResearch Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India.T.Saratha DeviDepartment of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India.Journal Article20140520An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} according as p is even
or odd. A graph which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph.University of TehranJournal of Algorithms and Computation2476-277645120141230More On λκ−closed sets in generalized topological spaces35417919ENR.JamunaraniResearch Center, Department of Mathematics, Govindammal Aditanar College for Women,
Tiruchendur-628 215, Tamil Nadu, IndiaP.JeyanthiResearch Center, Department of Mathematics, Govindammal Aditanar College for Women,
Tiruchendur-628 215, Tamil Nadu, IndiaM.VelrajanResearch Center, Department of Mathematics, Aditanar College of Arts and Science,,
Tiruchendur - 628 216, Tamil Nadu, IndiaJournal Article20140202In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.