The convexity number denoted by in a connected graph is the maximum cardinality of a proper convex set in . Here in this paper graphs for which the independence number ( ) of a graph where ( ) = , ( ) < and ( ) > are completely characterised. Also graphs for which ( ) = are characterised. Construction of graphs with prescribed ( ) and are presented.