Semi strong chromatic number of a graph
E. Sampathkumar, L. Pushpalatha · MyPrints@UOM (Mysore University Library) · 1995
The `semi-strong chromatic number' chi(s)(G) of a graph G is the minimum order of a partition L of V(G) such that every set S in L has the property : no vertex of G has two neighbours in S. The number chi(s)(G) is determined for various known graphs including trees and block graphs, and some bounds are obtained for it. Also graphs G for which chi(s)(G) = \\textbackslashV(G)\\textbackslash are characterized and an open problem is stated.