Toroidal queens graphs over finite fields

نویسنده

  • William D. Weakley
چکیده

For each positive integer n, the toroidal queens graph may be described as a graph with vertex set Zn × Zn where every vertex is adjacent to those vertices in the directions (1, 0), (0, 1), (1, 1), (1,−1) from it. We here extend this idea, examining graphs with vertex set F × F , where F is a finite field, and any four directions are used to define adjacency. The automorphism groups and isomorphism classes of such graphs are found.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper bounds for the domination numbers of toroidal queens graphs

We determine upper bounds for γ(Qn) and i(Qn), the domination and independent domination numbers, respectively, of the graph Qn obtained from the moves of queens on the n× n chessboard drawn on the torus.

متن کامل

Minimum Tenacity of Toroidal graphs

The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...

متن کامل

Construction Through Decomposition : A Linear Time Algorithm Cor the N - queens Problem

Configuring N mutually non-attacking queens on an N-by-N chessboard is a contemporary problem that was first posed over a century ago. Over the past few decades, this problem has become important to computer scientists by serving as the standard example of backtracking search methods. A related problem, placing the N queens on a toroidal board, has been discussed in detail by Polya and Chandra,...

متن کامل

Queens on Non-square Tori

We prove that for m < n, the n × m rectangular toroidal chessboard admits gcd(m,n) nonattacking queens except in the case m = 3, n = 6. The classical n-queens problem is to place n queens on the n × n chessboard such that no pair is attacking each other. Solutions for this problem exist for all for n = 2, 3 [1]. The queens problem on a rectangular board is of little interest; on the n ×m board ...

متن کامل

The domination number of the toroidal queens graph of size 3k×3k

Denote the n× n toroidal queens graph by Qn. We show that γ(Q3k) = k + 2 when k ≡ 0, 3, 4, 6, 8, 9 (mod 12). This completes the proof that γ(Q3k) = 2k − β(Qk) for all positive integers k.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2013