Solution to some open problems on E-super vertex magic labeling of disconnected graphs

DOI10.1016/J.AMC.2015.06.096zbMATH Open1410.05178OpenAlexW887781496MaRDI QIDQ668167FDOQ668167

Authors: G. Marimuthu, G. Kumar 

Publication date: 18 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.096

Recommendations

• Solution to some open problems on \(E\)-super vertex magic total labeling of graphs
• \(E\)-super vertex magic labelling of graphs and some open problems
• \(E\)-super vertex magic labelings of graphs
• Note on \(E\)-super vertex magic graphs
• On the degrees of \(E\)-super vertex-magic graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• A conjecture on strong magic labelings of 2-regular graphs
• Vertex-magic labelings of regular graphs. II.
• Super vertex-magic labeling.
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
• Magic Graphs
• \(E\)-super vertex magic labelings of graphs
• Title not available (Why is that?)
• On super vertex-magic labeling

Cited In (3)

• E-super vertex magic labeling of cartoon flowers and wounded flowers
• \(E\)-super vertex magic regular graphs of odd degree
• \(C_m\)-\(E\)-supermagic labeling of graphs

This page was built for publication: Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs

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