eng
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2014-11-15
45
1
1
12
350
Skolem Odd Difference Mean Graphs
P. Jeyanthi
jeyajeyanthi@rediffmail.com
1
D. Ramya
aymar_padma@yahoo.co.in
2
R. Kalaiyarasi
2014prasanna@gmail.com
3
Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA
Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.
Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur- 628 215, India.
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.
http://jac.ut.ac.ir/pdf_350_727d297ed723f77921f5f0cb0b62cd65.html
mean labeling
skolem difference mean labeling
skolem odd difference mean labeling
skolem odd difference mean graph
skolem even vertex odd difference mean labeling
eng
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2014-11-15
45
1
13
24
351
Three Graceful Operations
Sarah Minion
sarah.m.minion@gmail.com
1
Christian Barrientos
chr_barrientos@yahoo.com
2
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
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.
http://jac.ut.ac.ir/pdf_351_40bafdc72fac86dcf4daf6687498fa6f.html
graceful labeling
-labeling
union
third power
sym-metric product
eng
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2014-11-20
45
1
25
34
352
Edge pair sum labeling of spider graph
P. Jeyanthi
jeyajeyanthi@rediffmail.com
1
T. Saratha Devi
rajanvino03@gmail.com
2
Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India.
Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India.
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.
http://jac.ut.ac.ir/pdf_352_d0a0b362799482703ea6296c4b91f013.html
Edge pair sum labeling
edge pair sum graph
spider graph
eng
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2014-12-30
45
1
35
41
353
More On λκ−closed sets in generalized topological spaces
R. Jamunarani
jamunarani1977@gmail.com
1
P. Jeyanthi
jeyajeyanthi@rediffmail.com
2
M. Velrajan
velrajanm@yahoo.com
3
Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India
Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India
Research Center, Department of Mathematics, Aditanar College of Arts and Science,, Tiruchendur - 628 216, Tamil Nadu, India
In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.
http://jac.ut.ac.ir/pdf_353_0e4873387ee698f2b9a4844fcdafb9e9.html
Generalized topology
µ−open set
µ−closed set
quasi-topology
strong space
Λκ−set
λκ−open set
λκ−closed set
eng
University of Tehran
Journal of Algorithms and Computation
2776-2476
2476-2784
2014-12-30
45
1
43
54
354
The Mean Labeling of Some Crowns
M. E. Abdel-Aal
mohamed_el77@yahoo.com
1
S. Minion
sarah.m.minion@gmail.com
2
C. Barrientos
chr_barrientos@yahoo.com
3
D. Williams
davidwilliams@clayton.edu
4
Department of Mathematics, Benha Univeristy, El-Shaheed Farid Nada, Banha, Qalyubia 13511, Egypt
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA.
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA.
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.
http://jac.ut.ac.ir/pdf_354_54ecbd311317abd1ff2dc3518ec27a83.html
mean labeling
graceful labeling
tree