Totally magic cordial labeling of mPn and mKn
DOI:
https://doi.org/10.4067/S0716-09172016000400001Keywords:
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.Abstract
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 mPn and mKn are totally magic cordial for various values of m and n.References
[1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin., 23, pp. 201—207, (1987).
[2] I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph
Theory, 22, pp. 247—258, (2002).
[3] F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).
[4] P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally
magic cordial labeling, SUT Journal of Mathematics, 49 (1), pp. 13—
18, (2013).
[5] 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).
[6] P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency
of some graphs, Utilitas Mathematica, (to appear).
[7] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of
some graphs, Journal of Algorithms and Computation, 46 (1), pp. 1-8,
(2015).
[2] I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph
Theory, 22, pp. 247—258, (2002).
[3] F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).
[4] P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally
magic cordial labeling, SUT Journal of Mathematics, 49 (1), pp. 13—
18, (2013).
[5] 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).
[6] P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency
of some graphs, Utilitas Mathematica, (to appear).
[7] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of
some graphs, Journal of Algorithms and Computation, 46 (1), pp. 1-8,
(2015).
Published
2017-03-23
How to Cite
[1]
P. Jeyanthi, N. A. Benseera, and I. Cahit, “Totally magic cordial labeling of mPn and mKn”, Proyecciones (Antofagasta, On line), vol. 35, no. 4, pp. 371-380, Mar. 2017.
Issue
Section
Artículos
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.