Sparse anti-magic squares and vertex-magic labelings of bipartite graphs

DOI10.1016/J.DISC.2006.04.032zbMath1107.05017DBLPjournals/dm/GrayM06OpenAlexW1969007599WikidataQ56444520 ScholiaQ56444520MaRDI QIDQ860453

J. A. MacDougall, I. D. Gray

Publication date: 9 January 2007

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

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

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

The existence spectrum for regular sparse anti-magic squares ⋮ Regular sparse anti-magic squares with small odd densities ⋮ Regular sparse anti-magic squares with the second maximum density ⋮ Constructions of regular sparse anti-magic squares ⋮ On the existence of regular sparse anti-magic squares of odd order

Cites Work

• Vertex-magic labeling of trees and forests
• Vertex-magic total labeling of odd complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sparse anti-magic squares and vertex-magic labelings of bipartite graphs