A conjecture on strong magic labelings of 2-regular graphs

DOI10.1016/j.disc.2008.12.020zbMath1228.05314OpenAlexW1976358384WikidataQ123164031 ScholiaQ123164031MaRDI QIDQ1043585

James M. McQuillan, Jeremy Holden, Daniel McQuillan

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.020

zbMATH Keywords

labeling2-regularstrong edge-magicstrong vertex-magicsuper vertex-magic

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (12)

On the degrees of \(E\)-super vertex-magic graphs ⋮ On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs ⋮ Vertex magic total labelings of 2-regular 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 power of digraph products applied to labelings ⋮ The jumping knight and other (super) edge-magic constructions ⋮ Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs ⋮ Existence of centre-complementary magic rectangles ⋮ Vertex-magic total labelings of even complete graphs ⋮ Towards generalizing MacDougall's conjecture on vertex-magic total labelings ⋮ On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Totally magic graphs
• 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
• Vertex‐Magic Total Labelings of Regular Graphs
• Magic Valuations of Finite Graphs

This page was built for publication: A conjecture on strong magic labelings of 2-regular graphs