Clique Vertex Magic Cover of a Graph

Let G admit an H-edge covering and f : V èE ? {1,2,?,n+e}{f : V \cup E \to \{1,2,\ldots,n+e\}} be a bijective mapping for G then f is called H-edge magic total labeling of G if there is a positive integer constant m(f) such that each subgraph H _i , i = 1, . . . , r of G is isomorphic to H and f(H_i)=f(H)=S_{v ? V(Hi)}f(v)+S_{e ? E(Hi)} f(e)=m(f){f(H_i)=f(H)=\Sigma_{v \in V(H_i)}f(v)+\Sigma_{e \in E(H_i)} f(e)=m(f)}. In this paper we define a subgraph-vertex magic cover of a graph and give some construction of some families of graphs that admit this property. We show the construction of some C _n - vertex magic covered and clique magic covered graphs.