Two new methods to obtain super vertex-magic total labelings of graphs

DOI10.1016/j.disc.2007.06.040zbMath1188.05115OpenAlexW2090853121MaRDI QIDQ932610

B. E. Eshmatov

Publication date: 11 July 2008

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

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

zbMATH Keywords

graphmagic graphsuper vertex-magic total labeling

Mathematics Subject Classification ID

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

Related Items

\(E\)-super vertex magic regular graphs of odd degree, On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs, Vertex-antimagic labelings of regular graphs, Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling, Magic labeling of disjoint union graphs, E-super vertex magic labeling of cartoon flowers and wounded flowers, On super edge-antimagic total labelings of \(mK_n\), Vertex-magic labelings of regular graphs. II., Super-vertex-antimagic total labelings of disconnected graphs

Cites Work

• A dynamic survey of graph labeling
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
• On the degrees of a strongly vertex-magic graph
• Vertex-magic total labeling of odd complete graphs
• Unnamed Item
• Unnamed Item