One modulo three mean labeling of transformed trees

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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jeyanthi,P, Maheswari,A, Pandiaraj,P
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2016
Materias:	Mean labeling one modulo three graceful labeling one modulo three mean labeling one modulo three mean graphs transformed tree
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000300005
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172016000300005
record_format	dspace
spelling	oai:scielo:S0716-091720160003000052016-10-03One modulo three mean labeling of transformed treesJeyanthi,PMaheswari,APandiaraj,P Mean labeling one modulo three graceful labeling one modulo three mean labeling one modulo three mean graphs transformed tree 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 <img src="http:/fbpe/img/proy/v35n3/art5_fig1.jpg" width="242" height="77"> and the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ° Kn, T ô K1,n, T ô Pn and T ô 2Pn are one modulo three mean graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.35 n.3 20162016-09-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000300005en10.4067/S0716-09172016000300005
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Mean labeling one modulo three graceful labeling one modulo three mean labeling one modulo three mean graphs transformed tree
spellingShingle	Mean labeling one modulo three graceful labeling one modulo three mean labeling one modulo three mean graphs transformed tree Jeyanthi,P Maheswari,A Pandiaraj,P One modulo three mean labeling of transformed trees
description	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 <img src="http:/fbpe/img/proy/v35n3/art5_fig1.jpg" width="242" height="77"> and the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ° Kn, T ô K1,n, T ô Pn and T ô 2Pn are one modulo three mean graphs.
author	Jeyanthi,P Maheswari,A Pandiaraj,P
author_facet	Jeyanthi,P Maheswari,A Pandiaraj,P
author_sort	Jeyanthi,P
title	One modulo three mean labeling of transformed trees
title_short	One modulo three mean labeling of transformed trees
title_full	One modulo three mean labeling of transformed trees
title_fullStr	One modulo three mean labeling of transformed trees
title_full_unstemmed	One modulo three mean labeling of transformed trees
title_sort	one modulo three mean labeling of transformed trees
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2016
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000300005
work_keys_str_mv	AT jeyanthip onemodulothreemeanlabelingoftransformedtrees AT maheswaria onemodulothreemeanlabelingoftransformedtrees AT pandiarajp onemodulothreemeanlabelingoftransformedtrees
_version_	1718439815199850496

One modulo three mean labeling of transformed trees

Ejemplares similares