The Graph theory is sort of complicated events into the structure they are reflected by the clear graphs, most of their graphs separated into each component when the characteristics of mother graphs are determined by the properties of their components (or) copies. Based these, E. Sampath kumar introduced the concept of duplicate graph of a mother Graph (1974). Duplicate graph (DG) means obtained by a finite undirected graph without or with and without multiple edges. Let G (V, E) be simple a graph. A duplicate graph of G is DG = (V1, E1), when the vertex set V1 = V U V’ and V∩V’ = ϕ and f: V→V’ is one-one onto and the edge set E1 of DG is defined as: The edge ab is in E if and only if both ab’ and a‘b are edges in E1. [2] Many scholars to prove some labeling for duplicate graph of some mother graphs. few scholars P. Vijayakumar, P.P. Ulaganathan and K. Thirusangu, have prove existence as some cordial labeling in duplicate graph of Star Graph [5]. P.Indira, B.Selvam, K.Thirusangu they have proved total 3 - sum cordial and product E-cordial labeling for the extended duplicate graph Of Quadrilateral snake graph [8]. E.Nanda gopal, V.Maheswari, P.Vijaya kumar have proved special labeling for the extended duplicate graph of Quadrilateral snake graph. [7]. in this paper, we prove that the Cordial, Product cordial and Sum divisor 3-equitable cordial labeling in Duplicate graph of Double Quadrilateral Flow Graph.