Totally magic cordial labeling of mPn and mKn

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) → {0,1} such that f (a) + f (b) + f (ab) ≡ C (mod 2) for all ab ∈ E(G) and |n f (0) - n f (1)| ≤ 1, where n f(i) (i = 0, 1) is the sum ofthe nu...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jeyanthi,P, Angel Benseera,N, Cahit,Ibrahim
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2016
Materias:	Binary magic total labeling cordial labeling totally magic cordial labeling totally magic cordial deficiency of a graph
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400001
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172016000400001
record_format	dspace
spelling	oai:scielo:S0716-091720160004000012017-01-05Totally magic cordial labeling of mPn and mKnJeyanthi,PAngel Benseera,NCahit,Ibrahim Binary magic total labeling cordial labeling totally magic cordial labeling totally magic cordial deficiency of a graph A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) → {0,1} such that f (a) + f (b) + f (ab) ≡ C (mod 2) for all ab ∈ E(G) and \|n f (0) - n f (1)\| ≤ 1, where n f(i) (i = 0, 1) is the sum ofthe number ofvertices and edges with label i. In this paper we establish that mPn and mKn are totally magic cordial for various values of m and n.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.35 n.4 20162016-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400001en10.4067/S0716-09172016000400001
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Binary magic total labeling cordial labeling totally magic cordial labeling totally magic cordial deficiency of a graph
spellingShingle	Binary magic total labeling cordial labeling totally magic cordial labeling totally magic cordial deficiency of a graph Jeyanthi,P Angel Benseera,N Cahit,Ibrahim Totally magic cordial labeling of mPn and mKn
description	A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) → {0,1} such that f (a) + f (b) + f (ab) ≡ C (mod 2) for all ab ∈ E(G) and \|n f (0) - n f (1)\| ≤ 1, where n f(i) (i = 0, 1) is the sum ofthe number ofvertices and edges with label i. In this paper we establish that mPn and mKn are totally magic cordial for various values of m and n.
author	Jeyanthi,P Angel Benseera,N Cahit,Ibrahim
author_facet	Jeyanthi,P Angel Benseera,N Cahit,Ibrahim
author_sort	Jeyanthi,P
title	Totally magic cordial labeling of mPn and mKn
title_short	Totally magic cordial labeling of mPn and mKn
title_full	Totally magic cordial labeling of mPn and mKn
title_fullStr	Totally magic cordial labeling of mPn and mKn
title_full_unstemmed	Totally magic cordial labeling of mPn and mKn
title_sort	totally magic cordial labeling of mpn and mkn
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2016
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400001
work_keys_str_mv	AT jeyanthip totallymagiccordiallabelingofmpnandmkn AT angelbenseeran totallymagiccordiallabelingofmpnandmkn AT cahitibrahim totallymagiccordiallabelingofmpnandmkn
_version_	1718439816577679360

Totally magic cordial labeling of mPn and mKn

Ejemplares similares