Spectrum of free-form Sudoku graphs

DOI10.1515/MATH-2018-0125MaRDI QIDQ1738271zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Abudayah, Omar Alomari, T. Sander

Publication date 29 March 2019

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

eigenvectorsspectrumSudoku

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: A free-form Sudoku puzzle is a square arrangement of m times m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1,...,m in the cells such that the numbers in every row, column and block are distinct. Represent each cell by a vertex and add edges between two vertices exactly when the corresponding cells, according to the rules, must contain different numbers. This yields the associated free-form Sudoku graph. This article studies the eigenvalues of free-form Sudoku graphs, most notably integrality. Further, we analyze the evolution of eigenvalues and eigenspaces of such graphs when the associated puzzle is subjected to a "blow up" operation, scaling the cell grid including its block partition.

Recommendations

• Integral free-form Sudoku graphs
• A study of the Sudoku graph family
• scientific article; zbMATH DE number 5356325
• scientific article; zbMATH DE number 5251073
• The Spectrum of Triangle-Free Graphs
• Sudoku number of graphs
• Spectra of graphs
• scientific article; zbMATH DE number 1219775
• M-polynomial based topological properties of Sudoku graphs
• Sudoku graphs are integral

Cites work

• A novel hybrid genetic algorithm for solving Sudoku puzzles
• An analogue of Ryser's theorem for partial Sudoku squares
• Confirmation of a conjecture concerning orthogonal Sudoku and bimagic squares
• Constructing ordered orthogonal arrays via sudoku
• Eigenvalues of complete multipartite graphs
• Generating sudoku puzzles and its applications in teaching mathematics
• How does Sudoku acquire integral eigenvalues?
• scientific article; zbMATH DE number 3908461 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Nest graphs and minimal complete symmetry groups for magic Sudoku variants
• On the maximality of a set of mutually orthogonal sudoku Latin squares
• Palindromic and sūdoku quasigroups
• Random Latin squares and Sudoku designs generation
• Solving sudoku: structures and strategies
• Sudoku graphs are integral
• Sudoku in mathematics lessons
• Taking Sudoku seriously. The math behind the world's most popular pencil puzzle
• The structure of reduced Sudoku grids and the Sudoku symmetry group

Cited in

(7)

• Integral free-form Sudoku graphs
• Sudoku pair Latin squares based on groups
• A regional Kronecker product and multiple-pair Latin squares
• Sudoku graphs are integral
• How does Sudoku acquire integral eigenvalues?
• The linear system for Sudoku and a fractional completion threshold
• Construction of some new Youden- m squares, incomplete Sudoku squares and PBIB designs

This page was built for publication: Spectrum of free-form Sudoku graphs

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