Does the degree sequence of an (almost) regular graph determine if it possesses a strong vertex-magic total labeling?
From MaRDI portal
Publication:6644906
Daniel McQuillan, Jonathan Calzadillas
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex magic total labelings of 2-regular graphs
- A conjecture on strong magic labelings of 2-regular graphs
- Magic labelings of triangles
- Vertex-magic labelings of regular graphs. II.
- Towards generalizing MacDougall's conjecture on vertex-magic total labelings
- Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion
- On the degrees of a strongly vertex-magic graph
- Vertex-magic total labeling of odd complete graphs
- Magic Graphs
- Vertex‐Magic Total Labelings of Regular Graphs
- Magic Valuations of Finite Graphs
- Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles
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)
