On polynomial digraphs

Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This paper studies some relationship between the polynomial (x, y) and the structure of G(). Key words: polynomial digraph, polynomial graph, Galois graph, Cayley digraph, algebraic variety.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Josep M. Brunat, Antonio Montes
• Keywords: Bivariate Polynomial, Directed Graph, DM 2006, Polynomial