Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore-5700 06, Karnataka, (India).
*E-mail: ghobadi_math@yahoo.com
**E-mail: ndsoner@yahoo.co.in
AMS Subject Classification: 05C70.
Let G be a graph with chromatic number χ (G) = k. The nbd-color number nχ (G) of G is the maximum number of color classes which are neighborhood sets of G, where the maximum is taken over all k-coloring of G. The chromatic bondage number ρ (G) of G is the minimum number of edges between two color classes in a k-coloring of G, where the minimum is taken over all k-coloring of G. In this paper we present several results on these parameters.
Neighborhood, independent neighborhood, coloring, chromatic bondage
