On V-super and E-super vertex-magic total labelings of graphs

DOI10.1016/J.ENDM.2015.05.033zbMATH Open1347.05204OpenAlexW744927962MaRDI QIDQ324966FDOQ324966

Authors: G. Marimuthu, G. Kumar 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.033

Recommendations

• scientific article; zbMATH DE number 7512784
• \(E\)-super vertex magic labelings of graphs
• Note on \(E\)-super vertex magic graphs
• \(E\)-super vertex magic labelling of graphs and some open problems
• Solution to some open problems on \(E\)-super vertex magic total labeling of graphs

zbMATH Keywords

\(E\)-super vertex-magic labeling\(V\)-super vertex-magic labelingvertex-magic total labeling

Mathematics Subject Classification ID

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

Cites Work

• A conjecture on strong magic labelings of 2-regular graphs
• Vertex-magic labelings of regular graphs. II.
• Super vertex-magic labeling.
• Vertex-magic labelings: mutations
• Magic Graphs
• On the degrees of \(E\)-super vertex-magic graphs
• Vertex-magic labeling of non-regular graphs
• Vertex-magic labeling of regular graphs: disjoint unions and assemblages
• \(E\)-super vertex magic labelings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On super vertex-magic labeling
• Note on \(E\)-super vertex magic graphs
• Two new methods to obtain super vertex-magic total labelings of graphs

Cited In (15)

• Title not available (Why is that?)
• Super vertex magic circulant graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(E\)-super vertex magic labelings of graphs
• Super vertex-magic total labelings of flower snark and related graph
• On super vertex-magic labeling
• Note on \(E\)-super vertex magic graphs
• Two new methods to obtain super vertex-magic total labelings of graphs
• \(E\)-super vertex magic labelling of graphs and some open problems
• Super vertex-magic total labelings of some circulant graphs
• Solution to some open problems on \(E\)-super vertex magic total labeling of graphs
• \(C_m\)-\(E\)-supermagic labeling of graphs
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling

This page was built for publication: On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs

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