The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju (\cite{[LJ]}). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.