The choice of graphs to test an algorithm or a number of algorithms is interesting. For an approximate algorithm we can design graphs with known result and then show how closely the algorithm generally performs as desired. The choice of the graphs is motivated by the demand of the particular algorithm. In this paper, we study the properties of some special graphs and propose algorithms for generation of these special graphs.