Every even-regular Hamiltonian graph is vertex-magic

DOI10.1016/J.DISC.2026.115028MaRDI QIDQ6835839zbMATH OpenFDO

Authors I. D. Gray, Daniel McQuillan, James M. McQuillan

Publication date 30 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115028

zbMATH Keywords

edge-magicHamiltonianlabelingmirrorregularvertex-magic

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A conjecture on strong magic labelings of 2-regular graphs
• A magical approach to some labeling conjectures
• All regular graphs of small odd order are vertex-magic
• Edge-magic and vertex-magic total labelings of certain cycles.
• Enlarging the classes of super edge-magic 2-regular graphs
• Every even cycle of order at least 8 has a mirror labeling
• Hamiltonian Cycles in Regular Graphs
• scientific article; zbMATH DE number 1735787 (Why is no real title available?)
• scientific article; zbMATH DE number 1123790 (Why is no real title available?)
• scientific article; zbMATH DE number 1496427 (Why is no real title available?)
• scientific article; zbMATH DE number 1760750 (Why is no real title available?)
• scientific article; zbMATH DE number 2104816 (Why is no real title available?)
• scientific article; zbMATH DE number 2187687 (Why is no real title available?)
• scientific article; zbMATH DE number 2230930 (Why is no real title available?)
• Magic Graphs
• Magic labelings of regular graphs
• Magic labelings of triangles
• Magic Valuations of Finite Graphs
• On two conjectures concerning vertex-magic total labelings of generalized Petersen graphs
• 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
• The place of super edge-magic labelings among other classes of labelings
• Vertex magic total labelings of 2-regular graphs
• Vertex-magic labeling of regular graphs: disjoint unions and assemblages
• Vertex-magic labelings of regular graphs. II.
• Vertex-magic total labeling of odd complete graphs
• Vertex-magic total labelings of even complete graphs
• Vertex‐Magic Total Labelings of Regular Graphs

This page was built for publication: Every even-regular Hamiltonian graph is vertex-magic

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