Publication:5488274

From MaRDI portal
Revision as of 04:01, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1101.05058MaRDI QIDQ5488274

No author found.

Publication date: 14 September 2006




Related Items

Super \((a, d)\)-\(H\)-antimagic labeling of subdivided graphs, Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs, Stacked book graphs are cycle-antimagic, On super \((a, d)\)-\(C_n\)-antimagic total labeling of disjoint union of cycles, Wheels are cycle-antimagic, \(C_m\)-supermagic labeling of graphs, \(H\)-\(V\)-super magic decomposition of complete bipartite graphs, \(H\)-\(E\)-super magic decomposition of complete bipartite graphs, Super (a, d)-G + e-antimagic total labeling of Gᵤ[Sn], NOTE ON SUPER \((a,1)\)–\(P_3\)–ANTIMAGIC TOTAL LABELING OF STAR \(S_n\), Tree-antimagicness of disconnected graphs, Super \(H\)-antimagic total covering for generalized antiprism and toroidal octagonal map, Two constructions of \(H\)-antimagic graphs, On super \((a, d)\)-\(H\)-antimagic total covering of star related graphs, On super \((a, d)\mathrm{-}Ph\)-antimagic total labeling of stars, On (F, H)-simultaneously-magic labelings of graphs, \(H\)-supermagic strength of some graphs, \(H\)-coverings of path-amalgamated ladders and fans, On $H$-antimagicness of Cartesian product of graphs, Cycle-magic graphs, --supermagic labeling of graphs, Star-supermagic decompositions of the complete bipartite graph minus a one-factor, Ladders and fan graphs are cycle-antimagic, Super edge-magic models, Clique vertex magic cover of a graph, \(H\)-supermagic labelings of graphs, Cycle-supermagic decompositions of complete multipartite graphs, On \(d\)-row (column) antimagic matrices and subset partitions, Magic and antimagic \(H\)-decompositions, On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles, Unnamed Item, OnH-antimagic decomposition of toroidal grids and triangulations, On magic and consecutive antimagic factorizations of graphs