A conjecture on strong magic labelings of 2-regular graphs
From MaRDI portal
Publication:1043585
DOI10.1016/j.disc.2008.12.020zbMath1228.05314WikidataQ123164031 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
05E30: Association schemes, strongly regular graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
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, Vertex-magic total labelings of even complete graphs, The power of digraph products applied to labelings, The jumping knight and other (super) edge-magic constructions
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item