Sudoku Squares and Chromatic Polynomials
نویسندگان
چکیده
T he Sudoku puzzle has become a very popular puzzle that many newspapers carry as a daily feature. The puzzle consists of a 9×9 grid in which some of the entries of the grid have a number from 1 to 9. One is then required to complete the grid in such a way that every row, every column, and every one of the nine 3× 3 sub-grids contain the digits from 1 to 9 exactly once. The sub-grids are shown in Figure 1.
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملOrthogonal latin squares of Sudoku type
Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.
متن کاملNumerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials
The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...
متن کاملConstructions of complete sets of orthogonal diagonal Sudoku squares
We prove that complete sets of orthogonal diagonal Sudoku latin squares (sometimes called Sudoku frames) exist of all orders p, where p is a prime. We also show that complete sets of orthogonal Sudoku frames which are left semi-diagonal exist of all orders p, s > 1. We conjecture that these may be right semi-diagonal also but we do not have a general proof. We show how these complete sets may b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007