Title
On polynomial digraphs
Abstract
Let @F(x,y) be a bivariate polynomial with complex coefficients. The zeroes of @F(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(@F). This paper studies some relationship between the polynomial @F(x,y) and the structure of G(@F).
Year
DOI
Venue
2006
10.1016/j.disc.2006.01.001
Discrete Mathematics
Keywords
Field
DocType
polynomial graph,cayley digraph,algebraic variety,polynomial digraph,galois graph,directed graph
Discrete mathematics,Combinatorics,Polynomial,Minimal polynomial (field theory),Cayley graph,Directed graph,Algebraic variety,Mathematics,Bivariate polynomials
Journal
Volume
Issue
ISSN
306
4
Discrete Mathematics
Citations 
PageRank 
References 
0
0.34
3
Authors
2
Name
Order
Citations
PageRank
Josep M. Brunat1425.52
Antonio Montes220519.68