On super vertex-magic labeling

DOI10.1080/09720529.2005.10698031zbMATH Open1082.05079OpenAlexW1971085797MaRDI QIDQ5717992FDOQ5717992

Authors:

Publication date: 13 January 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2005.10698031

Recommendations

• On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs
• scientific article; zbMATH DE number 7512784
• Note on \(E\)-super vertex magic graphs
• \(E\)-super vertex magic labelings of graphs
• Super vertex-magic total labelings of some circulant graphs

zbMATH Keywords

kite graph

Mathematics Subject Classification ID

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

Cites Work

• Vertex-magic labeling of trees and forests

Cited In (14)

• Super vertex-magic total labelings of \(W_{3,n}\)
• Further results on cycle-supermagic labeling
• Title not available (Why is that?)
• Super vertex magic chordal rings
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs
• On the degrees of \(E\)-super vertex-magic graphs
• \(E\)-super vertex magic labelings of graphs
• Super vertex-magic total labelings of flower snark and related graph
• Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs
• Super vertex-magic total labelings of some circulant graphs
• On super vertex magic total labeling of generalized Petersen 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 super vertex-magic labeling

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