𝔖 Bobbio Scriptorium
✦   LIBER   ✦

GRAPHING POLYNOMIALS WITH COMPUTER ASSISTANCE

✍ Scribed by JANE B. KENNEDY

Book ID
126823643
Publisher
National Council of Teachers of Mathematics
Year
1981
Weight
568 KB
Volume
74
Category
Article
ISSN
0025-5769

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computer generation of distance polynomi
Computer generation of distance polynomials of graphs
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 582 KB

A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. T

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

Lattices in graphs with polynomial growt
Lattices in graphs with polynomial growth
✍ AndrΓ‘s LukΓ‘cs; Norbert Seifter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 471 KB