Some bounds on chromatic number of NI graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.2, No. 2)Publication Date: 2012-07-22
Authors : Selvam Avadayappan M. Muthuchelvam;
Page : 79-83
Keywords : Regular graph; irregular graph; neighbourly irregular graph.;
Abstract
A connected graph is called neighbourly irregular (NI) if it contains no edge between the vertices of the same degree. In this paper we determine the upper bound for chromatic number of a neighbourly irregular graph. We also prove some results on neighbourly irregular graphs and its chromatic number.
Other Latest Articles
Last modified: 2013-08-24 02:30:46