A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank- optimal solution that corresponds to an optimal solution of the QCQP. Given a QCQP whose convex relaxation is exact, this paper investigates the incorporation of additional quadratic inequality constraints under a non-intersecting quadratic constraint condition while maintaining the exactness of the convex relaxation of the resulting QCQP. Specifically, we extend existing exact semidefinite programming relaxation, completely positive programming relaxation and doubly nonnegative programming relaxation of various classes of QCQPs in a unified manner. Illustrative examples are included to demonstrate the applicability of the established result.