Skolem difference mean labeling of disconnected graphs

P. Jeyanthi, M. Selvi, D. Ramya

Resumen



Palabras clave


Mean labeling ; Skolem difference mean labeling; Skolem difference mean graph.

Texto completo:

PDF

Referencias


HARARY, F. (1972) Graph theory. Massachusetts: Addison Wesley.

GALLIAN, JOSEPH A. (2015) A Dynamic Survey of Graph Labeling. EN: The Electronic Journal of Combinatorics. [s.l.: s.n.].

MURUGAN, K. (2012) Subramanaian, Labeling of finite union of paths. EN: International Journal of Mathematics and Soft Computing, 2, (1). [s.l.: s.n.], 99-108.

MURUGAN, K. (2011) Subramanaian, Skolem difference mean labeling of Hgraphs, International Journal of Mathematics and Soft Computing, 1, (1). [s.l.: s.n.], 115-129.

MURUGAN, K. (2015) Some Results on Skolem Difference Mean Graphs, International Journal of Mathematics and its Applications, 3, (3-D). [s.l.: s.n.], 75-80.

RAMYA, D. (2013) On skolem difference mean labeling of graphs. EN: International Journal of Mathematical Archive, 4, (12). [s.l.: s.n.], 73-79.

SELVI, M. (2015) Skolem difference mean Graphs. EN: Proyecciones Journal of Mathematics, 34 (3). [s.l.: s.n.], 243-254.

SOMASUNDARAM, S. (2003) Mean labelings of graphs. EN: National Academy Science Letter, (26). [s.l.: s.n.], 210-213.


Enlaces refback

  • No hay ningún enlace refback.