Two new methods to obtain super vertex-magic total labelings of graphs
From MaRDI portal
(Redirected from Publication:932610)
Recommendations
Cites work
- scientific article; zbMATH DE number 1614340 (Why is no real title available?)
- scientific article; zbMATH DE number 1760750 (Why is no real title available?)
- A dynamic survey of graph labeling
- On the degrees of a strongly vertex-magic graph
- Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
- Vertex-magic total labeling of odd complete graphs
Cited in
(14)- Vertex-magic total labelings of disconnected graphs
- Super-vertex-antimagic total labelings of disconnected graphs
- scientific article; zbMATH DE number 7512784 (Why is no real title available?)
- Super vertex-magic total labelings of flower snark and related graph
- scientific article; zbMATH DE number 6383852 (Why is no real title available?)
- E-super vertex magic labeling of cartoon flowers and wounded flowers
- Vertex-antimagic labelings of regular graphs
- Vertex-magic labelings of regular graphs. II.
- \(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
- Magic labeling of disjoint union graphs
- On super edge-antimagic total labelings of \(mK_n\)
- 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)
