Minimal Polynomials for the Coordinates of the Harborth Graph

Details Minimal Polynomials for the Coordinates of the Harborth Graph Minimal Polynomials for the Coordinates of the Harborth Graph

2006-09-13

arxiv.org/abs/math/0609360v3

Mathematics

Combinatorics

v1: documentclass amsart, 16 pages, 4 figures. v2: same as v1, but now has 18 pages, with a final section ("Coda") on the cons

Scientific paper

The Harborth graph is the smallest known example of a 4-regular planar unit-distance graph. In this paper we give an analytical description of the coordinates of its vertices for a particular embedding in the Euclidean plane. More precisely, we show, how to calculate the minimal polynomials of the coordinates of its vertices (with the help of a computer algebra system), and list those. Furthermore some algebraic properties of these polynomials, and consequences to the structure of the Harborth graph are determined.

Affiliated with

Also associated with

No associations

Rating

Minimal Polynomials for the Coordinates of the Harborth Graph 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 Minimal Polynomials for the Coordinates of the Harborth Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Polynomials for the Coordinates of the Harborth Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554837