Abstract
Given a symmetric polynomial Φ(x, y) over a perfect field k of characteristic zero, the Galois graph G(Φ) is defined by taking the algebraic closure \(\bar k\) as the vertex set and adjacencies corresponding to the zeroes of Φ(x, y). Some graph properties of G(Φ), such as lengths of walks, distances and cycles are described in terms of Φ. Symmetry is also considered, relating the Galois group Gal(\(\bar k\)/k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.
Article PDF
Similar content being viewed by others
References
G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd edition, Chapman & Hall, London, 1996.
P.M. Cohn, Algebra, Vol.1/2, John Wiley & Sons, Chichester, 1989.
N.D. Elkies, “A Remark on Elliptic K-Curves,” 1993, Preprint.
F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
J.H. Silverman, The Arithmetic of Elliptic Curves, GTM 106, Springer–Verlag, New York, 1986.
J.H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves, GTM 151, Springer–Verlag, New York, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brunat, J.M., Lario, JC. Galois Graphs: Walks, Trees and Automorphisms. Journal of Algebraic Combinatorics 10, 135–148 (1999). https://doi.org/10.1023/A:1018723511986
Issue Date:
DOI: https://doi.org/10.1023/A:1018723511986