๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Newtonian graphs for families of complex polynomials

โœ Scribed by Jeremy Kahn

Book ID
103920768
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
675 KB
Volume
7
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

โœฆ Synopsis

The Newtonian graph of all polynomials of degree 4 and all polynomials (x "+I -1)/(x -1) for n 5 24 is determined.

๐Ÿ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
โœ Haruo Hosoya; K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur