One modulo three mean labeling of transformed trees



Document title: One modulo three mean labeling of transformed trees
Journal: Proyecciones (Antofagasta)
Database: PERIÓDICA
System number: 000406112
ISSN: 0716-0917
Authors: 1
2
2
Institutions: 1Govindammal Aditanar College for Women, Department of Mathematics, Thoothukudi, Tamil Nadu. India
2Kamaraj College of Engineering and Technology, Department of Mathematics, Virudhunagar, Tamil Nadu. India
Year:
Season: Sep
Volumen: 35
Number: 3
Pages: 277-289
Country: Chile
Language: Inglés
Document type: Artículo
Approach: Analítico
English abstract A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a|0 ≤ a ≤ 3q− 2 and either a ≡ 0(mod 3) or a ≡ 1(mod 3)} where q is the number of edges G and φ induces a bijection φ∗ from the edge set of G to {a|1 ≤ a ≤ 3q − 2 and either a ≡ 1(mod 3)} given by φ∗(uv) = lφ(u)+φ(v) 2 m and the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ¯Kn, ToKˆ 1,n, ToPˆ n and Toˆ2Pn are one modulo three mean graphs
Disciplines: Matemáticas
Keyword: Matemáticas aplicadas,
Matemáticas puras,
Combinatoria,
Teoría de gráficas,
Etiquetado,
Arboles
Keyword: Mathematics,
Applied mathematics,
Pure mathematics,
Combinatorics,
Graph theory,
Labelling,
Trees
Full text: Texto completo (Ver PDF)