Open Access
June 2011 Differential Coloring of Graphs
P. Roushini Leely Pushpam, I. Sahul Hamid, D. Yokesh
Author Affiliations +
SUT J. Math. 47(2): 161-174 (June 2011). DOI: 10.55937/sut/1326390046


Let G=(V,E) be a connected graph. For a set SV, the differential of S, denoted by (S), is defined to be (S)=|B(S)||S|, where B(S)=N(S)(VS). A set SV is said to be a positive differential set if (S)0. A partition {V1,V2,,Vk} of V is said to be a positive differential chromatic partition of G if each Vi is both independent and positive differential. The minimum order of a positive differential chromatic partition of G is called the differential chromatic number of G and is denoted by χ(G). In this paper we initiate a study of this parameter.


Download Citation

P. Roushini Leely Pushpam. I. Sahul Hamid. D. Yokesh. "Differential Coloring of Graphs." SUT J. Math. 47 (2) 161 - 174, June 2011.


Received: 11 March 2011; Revised: 18 September 2011; Published: June 2011
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1326390046

Primary: 05C

Keywords: differential chromatic number , Differential coloring

Rights: Copyright © 2011 Tokyo University of Science

Vol.47 • No. 2 • June 2011
Back to Top