On the degrees of a strongly vertex-magic graph

DOI10.1016/j.disc.2006.01.019zbMath1176.05070OpenAlexW2035898005MaRDI QIDQ2488927

Yanyan Li

Publication date: 16 May 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.019

zbMATH Keywords

minimum degreevertex-magic total labelingstrongly vertex-magic graphsupervertex-magic

Mathematics Subject Classification ID

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

Related Items (6)

On the degrees of \(E\)-super vertex-magic graphs ⋮ Two new methods to obtain super vertex-magic total labelings of graphs ⋮ Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling ⋮ Consecutive magic graphs ⋮ A conjecture on strong magic labelings of 2-regular graphs ⋮ Super-vertex-antimagic total labelings of disconnected graphs

Cites Work

• A dynamic survey of graph labeling
• Super vertex-magic labeling.
• Note on Hamilton Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the degrees of a strongly vertex-magic graph