Add to ORKGA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle C. Then the graph G is C-magic if there exists a total labelling f : V ∪ E → {1, 2, . . . , |V | + |E|} such that, for every subgraph H'=(V',E') of G isomorphic to C, $\Sigma_{v\in V'^{f{(v)}}}$ + $\Sigma{e \in E'}f^{(e)}$ is constant. When f(V)= {1, . . . , |V|}, then G is said to be C-supermagic. We study the cyclic-magic and cyclic-supermagic behavior of several classes of connected graphs. We give several families of Cr -magic graphs for each r≥3. The results rely on a technique of partitioning sets of integers with special properties
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
A simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G admit an H-edge covering and f : V⋃E → {1,2,…,n+e} be a bijective mapping for G then f is call...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \t...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
A simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G admit an H-edge covering and f : V⋃E → {1,2,…,n+e} be a bijective mapping for G then f is call...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \t...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...