D-distance Magic Labeling on Some Class of Graphs

  • Authors

    • Shankaran P
    • Chaithra K
    https://doi.org/10.14419/ijet.v7i3.34.19577
  • distance magic labeling, centre, path, diameter, complete graph.

  • In this paper we study  -distance magic labeling on path with n vertices, D-distance magic labeling on trees when D= (0,1) and D=(d) where d is a  diameter of tree and (0,1)-distance magic labeling of complete graph..

     

     

  • References

    1. [1] A.O’Neal,P.Slater,Uniqueness of vertex magic constants, Siam J.Discrete Math.27(2013)708-716.

      [2] Harary,Graph theory,Narosa Publishing House,1988.

      [3] J.Gallian,A dynamic survey of graph labeling,Elec.J.Combin.DS6.

      [4] MirkaMiller,ChrishRodger,Rinovia Simanjuntak, Distance magic labelings of graphs,volume 28(2003)

      [5] Rachel Rupnow,A survey of distance magic graphs(2014)

      [6] Rinovia Simanjuntak,Mona Elviyenti,Magic labeling of distance atmost2,2012

      [7] S.Armugam,D.Froncek and N.Kamatchi,Distance magic graphs-a survey,J.Indones.Math.Soc.,Special Edition(2011):11-26.

  • Downloads

  • How to Cite

    P, S., & K, C. (2018). D-distance Magic Labeling on Some Class of Graphs. International Journal of Engineering & Technology, 7(3.34), 465-466. https://doi.org/10.14419/ijet.v7i3.34.19577