J. Algorithm Comput. University of Tehran Journal of Algorithms and Computation 2476-2776 University of Tehran 129 Research Paper Skolem Odd Difference Mean Graphs Skolem Odd Difference Mean Graphs Jeyanthi P. Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA Ramya D. Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India. Kalaiyarasi R. Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India. 15 11 2014 45 1 1 12 26 07 2014 05 10 2014 Copyright © 2014, University of Tehran. 2014 https://jac.ut.ac.ir/article_7916.html

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

mean labeling skolem difference mean labeling skolem odd difference mean labeling skolem odd difference mean graph skolem even vertex odd difference mean labeling
J. Algorithm Comput. University of Tehran Journal of Algorithms and Computation 2476-2776 University of Tehran 129 Research Paper Three Graceful Operations Three Graceful Operations Minion Sarah Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA Barrientos Christian Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA 15 11 2014 45 1 13 24 26 07 2014 31 10 2014 Copyright © 2014, University of Tehran. 2014 https://jac.ut.ac.ir/article_7917.html

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

graceful labeling -labeling union third power sym-metric product
J. Algorithm Comput. University of Tehran Journal of Algorithms and Computation 2476-2776 University of Tehran 129 Research Paper Edge pair sum labeling of spider graph Edge pair sum labeling of spider graph Jeyanthi P. Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India. Saratha Devi T. Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India. 20 11 2014 45 1 25 34 20 05 2014 12 11 2014 Copyright © 2014, University of Tehran. 2014 https://jac.ut.ac.ir/article_7918.html

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

Edge pair sum labeling edge pair sum graph spider graph
J. Algorithm Comput. University of Tehran Journal of Algorithms and Computation 2476-2776 University of Tehran 129 Research Paper More On λκ−closed sets in generalized topological spaces More On λκ−closed sets in generalized topological spaces Jamunarani R. Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India Jeyanthi P. Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India Velrajan M. Research Center, Department of Mathematics, Aditanar College of Arts and Science,, Tiruchendur - 628 216, Tamil Nadu, India 30 12 2014 45 1 35 41 02 02 2014 19 12 2014 Copyright © 2014, University of Tehran. 2014 https://jac.ut.ac.ir/article_7919.html

In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.

Generalized topology µ−open set µ−closed set quasi-topology strong space Λκ−set λκ−open set λκ−closed set