Linear order Concentrators and Superconcentrators have been studied extensively for their ability to interconnect large numbers of devices in parallel, whether in communication systems or in parallel computers. One major limitation on the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators, O(n), can be used to construct theoretically optimal interconnection network schemes. Existing explicitly the defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical lot reasonable sized networks. It demands the construction of concentrator which uses the expander with the smaller expansion constant. This paper introduces an improvement on the method of constructing concentrators using expanders, which reduce the size of resulting concentrator built from any given expander by a constant factor.