On H-supermagic labelings of m-shadow of paths and cycles

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Summary: A simple graph \(G = (V, E)\) is said to be an \(H\)-covering if every edge of \(G\) belongs to at least one subgraph isomorphic to \(H\). A bijection \(f : V \cup E \longrightarrow \{1,2, 3, \dots, |V|+|E|\}\) is an \((a,d)\)-\(H\)-antimagic total labeling of \(G\) if, for all subgraphs \(H'\) isomorphic to \(H\), the sum of labels of all vertices and edges in \(H'\) form an arithmetic sequence \(\{a, a + d, \ldots,(k - 1) d \}\) where \(a > 0\), \(d \geq 0\) are two fixed integers and \(k\) is the number of all subgraphs of \(G\) isomorphic to \(H\). The labeling \(f\) is called \textit{ super} if the smallest possible labels appear on the vertices. A graph that admits (super) \((a,d)\)-\(H\)-antimagic total labeling is called (super) \((a,d)\)-\(H\)-antimagic. For a special \(d = 0\), the (super) \((a,0)\)-\(H\)-antimagic total labeling is called \(H\)-(super)magic labeling. A graph that admits such a labeling is called \(H\)-(super)magic. The \(m\)-shadow of graph \(G, D_m(G)\), is a graph obtained by taking \(m\) copies of \(G\), namely, \(G_1, G_2, \dots, G_m\), and then joining every vertex \(u\) in \(G_i, i \in \{1,2, \ldots, m - 1 \}\), to the neighbors of the corresponding vertex \(v\) in \(G_{i + 1}\). In this paper we studied the \(H\)-supermagic labelings of \(D_m(G)\) where \(G\) are paths and cycles.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330294)