Two new methods to obtain super vertex-magic total labelings of graphs
From MaRDI portal
Publication:932610
DOI10.1016/J.DISC.2007.06.040zbMATH Open1188.05115OpenAlexW2090853121MaRDI QIDQ932610FDOQ932610
Authors: 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
Recommendations
Cites Work
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Vertex-magic total labeling of odd complete graphs
Cited In (14)
- E-super vertex magic labeling of cartoon flowers and wounded flowers
- Title not available (Why is that?)
- Magic labeling of disjoint union graphs
- Vertex-antimagic labelings of regular graphs
- Title not available (Why is that?)
- On super edge-antimagic total labelings of \(mK_n\)
- \(E\)-super vertex magic regular graphs of odd degree
- On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs
- Vertex magic total labelings of 2-regular graphs
- Super vertex-magic total labelings of flower snark and related graph
- Vertex-magic labelings of regular graphs. II.
- Super-vertex-antimagic total labelings of disconnected graphs
- Vertex-magic total labelings of disconnected 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: Two new methods to obtain 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 Q932610)
