Divided square difference cordial labeling of some special graphs

  • Authors

    • Alfred Leo Bharathiar University
    • Vikrama Prasad Goverenment arts college
    2018-06-06
    https://doi.org/10.14419/ijet.v7i2.12720
  • Bistar, 〖 C〗_(n-2) K_2, Flower Graph, Helm Graph, Jewel Graph, 〖(K_m ) ̅∪P_n 2K〗_1, P_n (K_m ) Ì…, Wheel Graph.

  • In this article, we have introduced the concepts of divided square difference cordial labeling behavior of some special graphs called Jewel graph, Wheel graph, Helm graph, Flower graph, and Bistar.

  • References

    1. [1] A.Alfred Leo, R.Vikramaprasad and R.Dhavaseelan; Divided square difference cordial labeling graphs, International journal of Mechanical Engineering and Technology, 9 (1), (Jan 2018), pp.1137 – 1144.

      [2] Bondy J.A and Murty.U.S.R, Graph theory and applications, North Holland, New York, (1976).https://doi.org/10.1007/978-1-349-03521-2.

      [3] I. Cahit, “Cordial graphs: a weaker version of graceful and harmonious graphs,†Ars Combinatoria, 23(1987), pp. 201–207.

      [4] David M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, (1980).

      [5] R.Dhavaseelan, R.Vikramaprasad and S.Abhirami; A New Notions of Cordial Labeling Graphs, Global Journal of Pure and Applied Mathematics, 11 (4) (2015), pp.1767 – 1774.

      [6] J. A. Gallian, A dynamic survey of graph labeling, Electronic J. Combin. 15 (2008), DS6, pp.1 – 190.

      [7] F. Harary, Graph theory, Addison-Wesley, Reading, MA. (1969).https://doi.org/10.21236/AD0705364.

      [8] P. Lawrence Rozario Raj and R. Valli, Some new families of divisor cordial graphs, International Journal of Mathematics Trends and Technology, 7(2), (2014), pp.94–102.https://doi.org/10.14445/22315373/IJMTT-V7P512.

      [9] A. Rosa, on certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris, (1967), pp.349 – 355.

      [10] Rosen, Kenneth H, Discrete Mathematics and its applications, 7th edition, McGraw-Hill, (2011), pp. 655.

      [11] S.K.Vaidya and N.H.Shah, Further results on divisor cordial labeling, Annals of Pure and Applied Mathematics, 14(2), (2013), pp. 150-159.

  • Downloads

  • How to Cite

    Leo, A., & Prasad, V. (2018). Divided square difference cordial labeling of some special graphs. International Journal of Engineering & Technology, 7(2), 935-938. https://doi.org/10.14419/ijet.v7i2.12720