k-Zumkeller Labeling of Graphs

  • Authors

    • B. J. Balamurugan
    • K. Thirusangu
    • D. G. Thomas
    • B. J. Murali
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.21040
  • Graphs, labeling, Zumkeller numbers, k-Zumkeller labeling.

  • Abstract

    In this paper, we mainly focus on to prove that the graphs, viz., (i)paths, (ii) comb graphs, (iii) cycles, (iv) ladder graphs and (v) Pn´Pn graphs are k-Zumkeller graphs.

     

     

  • References

    1. [1] Balamurugan BJ, Thirusangu K, Thomas DG (2013), Strongly multiplicative Zumkeller labeling of graphs. International Conference on Information and Mathematical Sciences, Elsevier, 349-354.

      [2] Balamurugan BJ, Thirusangu K, Thomas DG (2014), Zumkeller labeling of some cycle related graphs. Proceedings of International Conference on Mathematical Sciences (ICMS - 2014), Elsevier, 549-553.

      [3] Balamurugan BJ, Thirusangu K, Thomas DG (2015), Zumkeller labeling algorithms for complete bipartite graphs and wheel graphs. Advances in Intelligent Systems and Computing, Springer 324, 405-413.

      [4] Balamurugan BJ, Thirusangu K, Thomas DG (2015), Algorithms for Zumkeller labeling of full binary trees and square grids. Advances in Intelligent Systems and Computing, Springer 325, 183-192.

      [5] Balamurugan BJ, Thirusangu K, Thomas DG (2015), k-Zumkeller labeling for twig graphs. Electronic Notes in Discrete Mathematics, Elsevier 48, 119-126.

      [6] Bloom GS, Golomb SW (1977), Applications of numbered undirected graphs. IEEE, 165 of 4, 526-570.

      [7] Gallian JA (2016), A dynamic survey of graph labeling. Electronic Journal of Combinatorics 17 (DS6).

      [8] Harary F, Graph theory. Addison-Wesley, Reading Mass, (1972).

      [9] Murali BJ, Thirusangu K, Balamurugan BJ (2017), Zumkeller cordial labeling of cycle related graphs. International Journal of Pure and Applied Mathematics 116(3), 617-627.

      [10] Richard Johnsonbaugh, Discrete Mathematics. Pearson Education, Asia, (2001).

      [11] Rosa A (1966), On certain valuations of the vertices of a graph. In N.B. Gordan and Dunad, editors, Theory of graphs. International Symposium, Paris, 349-359.

      [12] Srinivasan AK (1948), Practical numbers. Current Science 17, 179-180.

      [13] YuejianPeng, BhaskaraRao KPS (2013), On Zumkeller numbers. Journal of Number Theory 133(4), 1135-1155.

  • Downloads

  • How to Cite

    J. Balamurugan, B., Thirusangu, K., G. Thomas, D., & J. Murali, B. (2018). k-Zumkeller Labeling of Graphs. International Journal of Engineering & Technology, 7(4.10), 460-463. https://doi.org/10.14419/ijet.v7i4.10.21040

    Received date: 2018-10-05

    Accepted date: 2018-10-05

    Published date: 2018-10-02