Odd vertex equitable even labeling of graphs

• Jeyanthi, P. ^[1] ; Maheswari, A. ^[2] ; Vijayalakshmi, M. ^[3]
  1. [1] Govindammal Aditanar College for Women.
  2. [2] Kamaraj College of Engineering and Technology.
  3. [3] Dr. G. U. Pope College of Engineering.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 36, Nº. 1, 2017, págs. 1-11
• Idioma: inglés
• DOI: 10.4067/S0716-09172017000100001
• Enlaces
  • Texto completo
• Resumen

  • In this paper, we introduce a new labeling called odd vertex equitable even labeling. Let G be a graph with p vertices and q edges and A = {1, 3,..., q} if q is odd or A = {1, 3,..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V(G) → A that induces an edge labeling f * defined by f * (uv) = f (u) + f (v) for all edges uv such thatfor all a and b in A, |vf (a) —vf (b)| ≤ 1 and the induced edge labels are 2, 4,..., 2q where vf (a) be the number of vertices v with f (v) = a for a ∈ A. A graph that admits odd vertex equitable even labeling is called odd vertex equitable even graph. We investigate the odd vertex equitable even behavior of some standard graphs.

• Referencias bibliográficas
  • Citas [1] I. Cahit, On cordial and 3-equitable labeling of graphs, Util. Math., 37, pp. 189—198, (1990).
  • [2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 17 ( 2015), #DS6.
  • [3] F. Harary, Graph Theory, Addison Wesley, Massachusetts, (1972).
  • [4] S. M. Hegde, and Sudhakar Shetty,On Graceful Trees, Applied Mathematics E- Notes, 2, pp. 192-197, (2002).
  • [5] A. Lourdusamy and M. Seenivasan, Vertex equitable labeling of graphs, Journal of Discrete Mathematical Sciences & Cryptography, 11(6),...
  • [6] K. Manickam and M. Marudai, Odd mean labelings of graphs, Bulletin of Pure and Applied Sciences, 25E(1), pp. 149—153, (2006).
  • [7] G. Sethuraman and P. Selvaraju, Gracefulness of Arbitrary Super Subdivision of Graphs, Indian J. Pure Appl. Math., 32 (7), pp. 1059—1064,...
  • [8] . S.Somasundaram and R. Ponraj, Mean labelings of graphs, National Academy Science letter, 26, pp. 210—213, (2003).