Some colouring problems for unit-quadrance graphs

Abstract: The quadrance between two points

A_{1} = (x_{1}, y_{1})

and

A_{2} = (x_{2}, y_{2})

is the number

Q (A_{1}, A_{2}) = (x_{1} - x_{2})^{2} + (y_{1} - y_{2})^{2}

. Let

q

be an odd prime power and

F_{q}

be the finite field with

q

elements. The unit-quadrance graph

D_{q}

has the vertex set

F_{q}^{2}

, and

X, Y i n F_{q}^{2}

are adjacent if and only if

Q (A_{1}, A_{2}) = 1

. In this paper, we study some colouring problems for the unit-quadrance graph

D_{q}

and discuss some open problems.

This page was built for publication: Some colouring problems for unit-quadrance graphs