arXiv · math/0601731
On polynomial digraphs
Abstract
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(Φ)$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Josep M. Brunat, Antonio Montes. 2006-01-31. On polynomial digraphs. https://doi.org/10.1016/j.disc.2006.01.001
Cite the original work for its findings. Save a collection to share your selection of sources.