Vertex equitable labeling of union of cyclic snake related 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. 35, Nº. 2, 2016, págs. 177-186
• Idioma: inglés
• DOI: 10.4067/S0716-09172016000200003
• Enlaces
  • Texto completo
• Resumen

  • Let G be a graph with p vértices and q edges and A = {0,1, 2,..., [q/2]}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f (v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf(a) — vfb)| ≤ 1 and the induced edge labels are 1, 2, 3,...,q. In this paper, we prove that key graph KY(m, n), P(2.QSn), P(m.QSn), C(n.QSm), NQ(m) and K1,n X P2are vertex equitable graphs.

• Referencias bibliográficas
  • Citas [1] F. Harary, Graph Theory, Addison Wesley, Massachusetts, (1972).
  • [2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, pp. 1-389, #DS6, (2015).
  • [3] A. Lourdusamy and M. Seenivasan, Vertex equitable labeling of graphs, Journal of Discrete Mathematical Sciences and Cryptography, 11 (6),...
  • [4] P. Jeyanthi and A. Maheswari, Some Results on Vertex Equitable Labeling, Open Journal of Discrete Mathematics, 2, pp. 51-57, (2012).
  • [5] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cycle and path related graphs, Utilitas Mathematica, 98, pp. 215-226, (2015).
  • [6] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of Transformed Trees, Journal of Algorithms and Computation, 44, pp. 9-20, (2013).
  • [7] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cyclic snakes and bistar graphs, Journal of Scientific Research, 6 (1), pp....
  • [8] P. Jeyanthi A. Maheswari and M. Vijaya Laksmi, Vertex equitable labeling of double alternate snake graphs, Journal of Algorithms and Computation,...
  • [9] P. Jeyanthi A. Maheswari, and M. Vijaya Laksmi, New results on vertex equitable labeling, Journal of Algebra Combinatorics Discrete Structures...
  • [10] P. Jeyanthi A. Maheswari, and M. Vijaya Laksmi, Vertex Equitable Labeling of Super Subdivision Graphs, Scientific International, 27 (4),...
  • [11] S.C. Shee and Y.S. Ho, The Cordiality of Path-union of n Copies of a Graph, Discrete Math., 151, pp. 221-229, (1996).