Planar Characterization – Graph Domination Graphs

  • Authors

    • A. Elakkiya
    • M. Yamuna
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.26634
  • Complement, Graph domination, Non planar, Non outer planar, Planar,

  • Abstract

    In this paper, we characterize planarity and outer planarity of complement of graph domination graphs and provide a MATLAB program for identifying graph domination graphs.

     

     

  • References

    1. [1] M. Yamuna, A. Elakkiya, “g - Uniquely colorable graphsâ€, IOPConf. Series: Materials Science and Engineering , Vol.263 ,( 2017).

      [2] M. Yamuna, A. Elakkiya,†Planar graph characterization of g- Uniquely colorable graphsâ€, IOP Conf. Series: Materials Sci-ence and Engineering ,Vol263, ( 2017 ).

      [3] Yamuna, M., Elakkiya, A., “Non domination subdivision stable graphsâ€, IOP Conf. Series: Materials Science and Engineering. Vol 263, ( 2017 ).

      [4] Yamuna, M., Elakkiya, A, “Planar graph characterization of NDSS graphsâ€, IOP Conf. Series: Materials Science and Engineering ,Vol 263 ,( 2017 ).

      [5] M. Yamuna, K.Karthika, “Minimal spanning tree from a minimum dominating setâ€, WSEAS Transactions on Mathematics, Vol.12,( 2013), pp. 1055 – 1064.

      [6] Harary, F,Graph Theory, Addison Wesley, Narosa Publishing House, (2001).

      [7] Haynes, T.W., Hedetniemi, S. T & Slater, P. J. Fundamentals of domination in graphs, New York, Marcel Dekker, ( 1998 ).

      [8] VenkatRao R. “ A material selection model using graph theory and matrix approach.â€, Materials sciences and Engineering,Vol A 431, pp.248 – 255.

  • Downloads

  • How to Cite

    Elakkiya, A., & Yamuna, M. (2018). Planar Characterization – Graph Domination Graphs. International Journal of Engineering & Technology, 7(4.10), 949-955. https://doi.org/10.14419/ijet.v7i4.10.26634

    Received date: 2019-01-29

    Accepted date: 2019-01-29

    Published date: 2018-10-02