English

Some colouring problems for unit-quadrance graphs

Combinatorics 2007-05-23 v1

Abstract

The quadrance between two points A1=(x1,y1)A_1 = (x_1, y_1) and A2=(x2,y2)A_2 = (x_2, y_2) is the number Q(A1,A2)=(x1x2)2+(y1y2)2Q (A_1, A_2) = (x_1 - x_2)^2 + (y_1 - y_2)^2. Let qq be an odd prime power and FqF_q be the finite field with qq elements. The unit-quadrance graph DqD_q has the vertex set Fq2F_q^2, and X,YFq2X, Y \in F_q^2 are adjacent if and only if Q(A1,A2)=1Q (A_1, A_2) = 1. In this paper, we study some colouring problems for the unit-quadrance graph DqD_q and discuss some open problems.

Cite

@article{arxiv.math/0606482,
  title  = {Some colouring problems for unit-quadrance graphs},
  author = {Le Anh Vinh},
  journal= {arXiv preprint arXiv:math/0606482},
  year   = {2007}
}