Planar Characterization – Graph Domination Graphs
About this article
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] M. Yamuna, A. Elakkiya, “ - Uniquely colorable graphs”, IOPConf. Series: Materials Science and Engineering , Vol.263 ,( 2017).
[2] M. Yamuna, A. Elakkiya,” Planar graph characterization of - 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.
View more references (3)
[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.