Some results on skolem odd difference mean labeling



Document title: Some results on skolem odd difference mean labeling
Journal: Proyecciones (Antofagasta)
Database: PERIÓDICA
System number: 000406122
ISSN: 0716-0917
Authors: 1
2
3
4
Institutions: 1Govindammal Aditanar College for Women, Department of Mathematics, Thoothukudi, Tamil Nadu. India
2Dr. Sivanthi Aditanar College of Engineering, Department of Mathematics, Thoothukudi, Tamil Nadu. India
3Government Arts College for Women, Department of Mathematics, Ramanathapuram, Tamil Nadu. India
4G. Venkataswamy Naidu College, Department of Mathematics, Thoothukudi, Tamil Nadu. India
Year:
Season: Dic
Volumen: 35
Number: 4
Pages: 405-415
Country: Chile
Language: Inglés
Document type: Artículo
Approach: Analítico
English abstract Let G = (V,E) be a graph with p vertices and q edges. A graph G is said to 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} defined by f ∗(e) = l|f(u)−f(v)| 2 m is a bijection. A graph that admits skolem odd difference mean labeling is called skolem odd difference mean graph. We call a skolem odd difference mean labeling as skolem even vertex odd difference mean labeling if all vertex labels are even. A graph that admits skolem even vertex odd difference mean labeling is called skolem even vertex odd difference mean graph. In this paper we prove that graphs B(m, n) : Pw, hPmoSni, mPn, mPn ∪ tPs and mK1,n ∪ tK1,s admit skolem odd difference mean labeling. If G(p, q) is a skolem odd differences mean graph then p ≥ q. Also, we prove that wheel, umbrella, Bn and Ln are not skolem odd difference mean graph
Disciplines: Matemáticas
Keyword: Matemáticas aplicadas,
Matemáticas puras,
Combinatoria,
Teoría de gráficas,
Etiquetado
Keyword: Mathematics,
Applied mathematics,
Pure mathematics,
Combinatorics,
Graph theory,
Labelling
Full text: Texto completo (Ver PDF)