The Medium Domination Number of Lexico Product of Two Paths P2 and Pn

  • Authors

    • M. Ramachandran
    • N. Parvathi
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.21032
  • Medium domination number, Lexico product.

  • Abstract

    Graph theory is a vibrant area in both applications and hypothetical. Graphs can be utilized as a demonstrating device for many problems of realistic consequence. It can be given out as mathematical models to identify a proper graph-theoretic problem. Domination is a hasty sprouting area of research in graph theory, and its various applications are distributed computing and societal networks. Duygu Vargor and Pinar Dundar [1] computed the idea of medium domination number exploited to scrutinize the pair of vertices. This paper study as explored the medium domination number of lexico product of two paths P2 and Pn.

     

     

  • References

    1. [1] Duygu Vargör, Pınar Dündar, The Medium domination number of a graph, Int. J. Pure and Applied Mathematics, 70(2011), 297–306

      [2] G. Sabidussi, Graph multiplication. Math. Z., 72(1960), 446–457

  • Downloads

  • How to Cite

    Ramachandran, M., & Parvathi, N. (2018). The Medium Domination Number of Lexico Product of Two Paths P2 and Pn. International Journal of Engineering & Technology, 7(4.10), 426-428. https://doi.org/10.14419/ijet.v7i4.10.21032

    Received date: 2018-10-05

    Accepted date: 2018-10-05

    Published date: 2018-10-02