Constructions of regular sparse anti-magic squares

DOI10.4134/BKMS.B210281zbMATH Open1492.05019arXiv2002.07357MaRDI QIDQ5089691FDOQ5089691

Wen Li, Guangzhou Chen, Bangying Xin, Ming Zhong

Publication date: 15 July 2022

Abstract: Graph labeling is a well-known and intensively investigated problem in graph theory. Sparse anti-magic squares are useful in constructing vertex-magic labeling for graphs. For positive integers $n,d$ and $d<n$, an $nimesn$ array $A$ based on $0,1,cdots,nd$ is called emph{a sparse anti-magic square of order $n$ with density $d$}, denoted by SAMS$(n,d)$, if each element of $1,2,cdots,nd$ occurs exactly one entry of $A$, and its row-sums, column-sums and two main diagonal sums constitute a set of $2n+2$ consecutive integers. An SAMS$(n,d)$ is called emph{regular} if there are exactly $d$ positive entries in each row, each column and each main diagonal. In this paper, we investigate the existence of regular sparse anti-magic squares of order $nequiv1,5pmod6$, and it is proved that for any $nequiv1,5pmod6$, there exists a regular SAMS$(n,d)$ if and only if $2leqdleqn-1$.

Full work available at URL: https://arxiv.org/abs/2002.07357

Recommendations

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

zbMATH Keywords

Latin squareKotzig array

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Unsolved problems on magic squares
• Vertex-magic labelings of regular graphs. II.
• Sparse semi-magic squares and vertex-magic labelings.
• Vertex-magic labeling of regular graphs: disjoint unions and assemblages
• Title not available (Why is that?)
• Vertex‐Magic Total Labelings of Regular Graphs
• Regular sparse anti-magic squares with the second maximum density
• Title not available (Why is that?)
• Antimagic labeling of cubic graphs
• Anti-magic labeling of trees
• Before Sudoku. The world of magic squares
• Anti-magic squares of even order
• On the existence of regular sparse anti-magic squares of odd order
• Regular sparse anti-magic squares with maximum density.
• Existence of regular sparse magic squares
• Title not available (Why is that?)
• Regular sparse anti-magic squares with small odd densities
• Sparse anti-magic squares and vertex-magic labelings of bipartite graphs
• Title not available (Why is that?)

Cited In (4)

• Regular sparse anti-magic squares with the second maximum density
• Title not available (Why is that?)
• Regular sparse anti-magic squares with small odd densities
• The existence spectrum for regular sparse anti-magic squares

This page was built for publication: Constructions of regular sparse anti-magic squares

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