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

The characteristic polynomials of modified graphs

โœ Scribed by Peter Rowlinson

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
678 KB
Volume
67
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

Computer generation of the characteristi
Computer generation of the characteristic polynomials of chemical graphs
โœ K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 497 KB

A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver