Totally magic cordial labeling of mPn and mKn

P. Jeyanthi, N. Angel Benseera, Ibrahim Cahit

Resumen


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 |nf (0) — nf (1)| ≤ 1, where nf(i) (i = 0, 1) is the sum ofthe number ofvertices and edges with label i. In this paper we establish that mPand mKn are totally magic cordial for various values of m and n.

Palabras clave


Binary magic total labeling; cordial labeling; totally magic cordial labeling; totally magic cordial deficiency of a graph; etiquetado mágico binario total; etiquetado cordial; etiquetado cordial totalmente mágico.

Texto completo:

PDF

Referencias


I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin., 23, pp. 201—207, (1987).

I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph

Theory, 22, pp. 247—258, (2002).

F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).

P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally

magic cordial labeling, SUT Journal of Mathematics, 49 (1), pp. 13—

, (2013).

P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of

one-point union of n copies of a graph, Opuscula Mathematica, 34 (1),

pp. 115—122, (2014).

P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency

of some graphs, Utilitas Mathematica, (to appear).

P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of

some graphs, Journal of Algorithms and Computation, 46 (1), pp. 1-8,

(2015).




DOI: http://dx.doi.org/10.4067/S0716-09172016000400001

Enlaces refback

  • No hay ningún enlace refback.