G, Properties – from , G
About this article
DOI:
https://doi.org/10.14419/ijet.v7i4.10.26657Keywords:
Chromatic Polynomial, Complement Graph, Just Excellent, Planar.Abstract
In this paper weprovide a method of determining the chromatic polynomial of without actual construction of . A planar graph characterization of graphs whose domatic partition is using properties is established and provide a MATLAB program for identifying just excellent graphs.
References
Yamuna, M., &Karthika, K, “ G*properties – without G*construction”, WSEAS Transaction on Mathematics,Vol15, ( 2016), pp312 – 314.
Yamuna, M., &Sridharan, N ,”Just excellent graphs”, International Journal of Engineering Science Advanced Computing and Bio-Technology, Vol1 (3),( 2010 ).pp.129-136.
Yamuna, M., &Karthika, K. “Domatic subdivision stable and just excellent graphs”. International Journal of Applied Sciences and In-novation,Vol 2, (2015), pp.56-60.
Yamuna, M., Elakkiya, A., “Non domination subdivision stable graphs”, IOP Conf. Series: Materials Science and Engineering. Vol 263, ( 2017 ).
Yamuna, M., Elakkiya, A, “Planar graph characterization of NDSS graphs”, IOP Conf. Series: Materials Science and Engineering ,Vol 263 ,( 2017 ).
View more references (4)
M. Yamuna, A. Elakkiya, “ - Uniquely colorable graphs”, IOPConf. Series: Materials Science and Engineering , Vol.263 ,( 2017).
M. Yamuna, A. Elakkiya,” Planar graph characterization of Uniquely colorable graphs”, IOP Conf. Series: Materials Science and Engineering ,Vol263, ( 2017 ).
Harary, F,Graph Theory, Addison Wesley, Narosa Publishing House, (2001).
Haynes, T.W., Hedetniemi, S. T & Slater, P. J. Fundamentals of domination in graphs, New York, Marcel Dekker, ( 1998 ).