Supermagic coverings of some simple graphs

MaRDI QIDQ3090021zbMATH OpenFDO

Authors P. Jeyanthi, P. Selvagopal

Publication date 25 August 2011

zbMATH Keywords

H-coveringH-magicH-supermagicSmarandachely pair

Mathematics Subject Classification ID

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

Recommendations

• Supermagic coverings of the disjoint union of graphs and amalgamations
• Magic coverings
• C_m-supermagic labeling of graphs
• On supermagic coverings of fans and ladders
• H-magic covering on some classes of graphs

Cited in

(14)

• \(H\)-coverings of path-amalgamated ladders and fans
• A supermagic labeling of finite copies of Cartesian product of cycles
• Supermagic coverings of the disjoint union of graphs and amalgamations
• On the G-supermagic coverings of graphs
• On \(d\)-row (column) antimagic matrices and subset partitions
• On supermagic coverings of fans and ladders
• Labeling, covering and decomposing of graphs -- Smarandache's notion in graph theory
• H-supermagic strength of some graphs
• H-magic covering on some classes of graphs
• P_h-supermagic labelings of some trees
• Super \((a,d)\)-star-antimagic graphs
• On H-supermagic labelings for certain shackles and amalgamations of a connected graph
• Magic coverings
• Magic covering of chain of an arbitrary 2-connected simple graph

This page was built for publication: Supermagic coverings of some simple graphs

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