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
Computer generation of generalized Wheland polynomials
✍ Scribed by Kenneth J. Kopecky; Milan Randić
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 849 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0097-8485
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
We prove that the existence of generic polynomials and generic extensions are equivalent over an infinite field.
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, A