Skolem Odd Difference Mean Graphs
P.
Jeyanthi
Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA
author
D.
Ramya
Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.
author
R.
Kalaiyarasi
Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.
author
text
article
2014
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
45
v.
1
no.
2014
1
12
https://jac.ut.ac.ir/article_7916_727d297ed723f77921f5f0cb0b62cd65.pdf
Three Graceful Operations
Sarah
Minion
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
author
Christian
Barrientos
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
author
text
article
2014
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
45
v.
1
no.
2014
13
24
https://jac.ut.ac.ir/article_7917_40bafdc72fac86dcf4daf6687498fa6f.pdf
Edge pair sum labeling of spider graph
P.
Jeyanthi
Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India.
author
T.
Saratha Devi
Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India.
author
text
article
2014
eng
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.
Journal of Algorithms and Computation
University of Tehran
2476-2776
45
v.
1
no.
2014
25
34
https://jac.ut.ac.ir/article_7918_d0a0b362799482703ea6296c4b91f013.pdf
More On λκ−closed sets in generalized topological spaces
R.
Jamunarani
Research Center, Department of Mathematics, Govindammal Aditanar College for Women,
Tiruchendur-628 215, Tamil Nadu, India
author
P.
Jeyanthi
Research Center, Department of Mathematics, Govindammal Aditanar College for Women,
Tiruchendur-628 215, Tamil Nadu, India
author
M.
Velrajan
Research Center, Department of Mathematics, Aditanar College of Arts and Science,,
Tiruchendur - 628 216, Tamil Nadu, India
author
text
article
2014
eng
In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.
Journal of Algorithms and Computation
University of Tehran
2476-2776
45
v.
1
no.
2014
35
41
https://jac.ut.ac.ir/article_7919_0e4873387ee698f2b9a4844fcdafb9e9.pdf
The Mean Labeling of Some Crowns
M. E.
Abdel-Aal
Department of Mathematics, Benha Univeristy, El-Shaheed Farid Nada, Banha, Qalyubia
13511, Egypt
author
S.
Minion
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
author
C.
Barrientos
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA.
author
D.
Williams
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA.
author
text
article
2014
eng
Mean labelings are a type of additive vertex labeling. This labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. In this paper we focus on mean labelings of some graphs that are the result of the corona operation. In particular we prove the existence of mean labelings for graphs of the form G ⊙ mK1 in the cases where G is an even cycle or G is an α-mean graph of odd size and the cardinalities of its stable sets differ by at most one unit. Under these conditions, we prove that G ⊙ P2 and G ⊙ P3 are also mean graphs, and that the class of α-graphs is equivalent to the class of α-mean graphs.
Journal of Algorithms and Computation
University of Tehran
2476-2776
45
v.
1
no.
2014
43
54
https://jac.ut.ac.ir/article_7920_54ecbd311317abd1ff2dc3518ec27a83.pdf