Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling?

MaRDI QIDQ6644906zbMATH OpenFDO

Authors Jonathan Calzadillas, Daniel McQuillan

Publication date 28 November 2024

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Gray's theoremspectrum of magic constants

Mathematics Subject Classification ID

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

Recommendations

• Vertex-magic labelings of regular graphs. II.
• Vertex‐Magic Total Labelings of Regular Graphs
• On the degrees of a strongly vertex-magic graph
• Vertex-magic labeling of non-regular graphs
• Towards generalizing MacDougall's conjecture on vertex-magic total labelings

Cites work

• A conjecture on strong magic labelings of 2-regular graphs
• All regular graphs of small odd order are vertex-magic
• scientific article; zbMATH DE number 1123790 (Why is no real title available?)
• scientific article; zbMATH DE number 1760750 (Why is no real title available?)
• Magic Graphs
• Magic labelings of triangles
• Magic Valuations of Finite Graphs
• On the degrees of a strongly vertex-magic graph
• Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion
• Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles
• Towards generalizing MacDougall's conjecture on vertex-magic total labelings
• Vertex magic total labelings of 2-regular graphs
• Vertex-magic labelings of regular graphs. II.
• Vertex-magic total labeling of odd complete graphs
• Vertex‐Magic Total Labelings of Regular Graphs

This page was built for publication: Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling?

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