Some colouring problems for unit-quadrance graphs

Details Some colouring problems for unit-quadrance graphs Some colouring problems for unit-quadrance graphs

2006-06-20

arxiv.org/abs/math/0606482v1

Mathematics

Combinatorics

Scientific paper

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 \in 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.

Affiliated with

Also associated with

No associations

Rating

Some colouring problems for unit-quadrance graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some colouring problems for unit-quadrance graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some colouring problems for unit-quadrance graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40274