Hardness results and approximation algorithms for some problems on graphs