%0 Journal Article
%T Some bounds on chromatic number of NI graphs
%A Selvam Avadayappan
%A M. Muthuchelvam
%J International Journal of Mathematics and Soft Computing
%D 2012
%I SweDha Publication
%X 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.
%K Regular graph
%K irregular graph
%K neighbourly irregular graph
%U http://ijmsc.com/index.php/ijmsc/article/view/2-2-11/pdf_3