b-Chromatic Number of M[Cn],M[Pn],M[F1,n] and M[Wn]英文文献资料.docVIP

Open Journal of Discrete Mathematics, 2011, 1, 85-88 doi:10.4236/ojdm.2011.12010 Published Online July 2011 (http://www.SciRP.org/journal/ojdm) b-chromatic Number of ? ? ? ? ? ? ? ? M C , M P , M F and M W ? ? n n 1,n n Duraisamy Vijayalakshmi 1 , Kandasamy Thilagavathi 2 , Narayanan Roopesh 3 1 Department of Maths CA, Kongunadu Arts Science College, Coimbatore, India Department of Mathematics, Kongunadu Arts Science College, Coimbatore, India Department of Mathematics, Indus College of Engineering, Coimbatore, India E-mail: vijikasc@, ktmaths@, roopeshsha@ Received April 2, 2011, revised May 2, 2011, accepted May 15, 2011 2 3 Abstract In this paper, we discuss about the b-colouring and b-chromatic number for middle graph of Cycle, Path, Fan ? ? ? ? ? ? ? ?. graph and Wheel graph denoted as M C , M P , M F and M W n ? ? n n 1,n Keywords: Chromatic Number, b-chromatic, b-colouring, Middle Graph 1. Introduction 2. b-chromatic Number of Middle Graph of Cycle Let G be a finite undirected graph with no loops and multiple edges. A coloring (i.e., proper coloring) of a graph G = (V,E) is an assignment of colors to the vertices of G, such that any two adjacent vertices have different colors. A coloring is called a b-coloring [1], if for each color i there exists a vertex xi of color i such that every color j ≠ i, there exists a vertex yj of color j adjacent to xi, such a vertex xi is called a dominating vertex for the colour class i or color dominating vertex which is known as b-chromatic vertex. The b-chromatic number of a graph G, denoted by ?(G) is the largest positive integer k such that G has a b-colouring by k colors. The b-chromatic number of a graph was introduced by R.W. Irwing and manlove [2] in the year 1999 by considering proper colorings that are minimal with respect to a partial order defined on the set of all partitions of V