H-supermagic strength of some graphs

DOI10.3836/TJM/1296483484zbMATH Open1216.05132OpenAlexW2036890199MaRDI QIDQ632497FDOQ632497

Authors: P. Jeyanthi, P. Selvagopal 

Publication date: 25 March 2011

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3836/tjm/1296483484

Recommendations

• \(H\)-supermagic labelings of graphs
• \(C_m\)-supermagic labeling of graphs
• Magic coverings
• Supermagic coverings of some simple graphs
• Magic covering of chain of an arbitrary 2-connected simple graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Magic coverings
• Title not available (Why is that?)
• On \(C_k\)-supermagic graphs
• Magic covering of chain of an arbitrary 2-connected simple graph

Cited In (12)

• \(H\)-coverings of path-amalgamated ladders and fans
• On $H$-antimagicness of Cartesian product of graphs
• Two constructions of \(H\)-antimagic graphs
• On \(d\)-row (column) antimagic matrices and subset partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cycle-supermagic decompositions of complete multipartite graphs
• Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs
• Magic and antimagic \(H\)-decompositions
• \(P_2 \rhd H\)-super antimagic total labeling of comb product of graphs
• On \(C_k\)-supermagic graphs
• Magic covering of chain of an arbitrary 2-connected simple graph

This page was built for publication: \(H\)-supermagic strength of some graphs

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