论文信息 - Computing the characteristic polynomial of a tree

Computing the characteristic polynomial of a tree

We present an O(n3)-algorithm for computing the characteristic polynomial of a tree in a certain factorized form. Each factor is caused by some structural property of the tree.ZusammenfassungWir stellen einen O(n3)-Algorithmus zur Berechnung des charakteristischen Polynoms eines Baumes vor. Der Algorithmus liefert dieses Polynom in einer faktorisierten Form, wobei jeder Faktor durch eine gewisse Struktureigenschaft des Baumes bestimmt ist.

Gottfried Tinhofer | Helmut Schreck | G. Tinhofer | H. Schreck

[1] L. Lovász,et al. On the eigenvalues of trees , 1973 .

[2] Michael Doob,et al. Spectra of graphs , 1980 .

[3] A. Schwenk. COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A GRAPH. , 1974 .

[4] Frank Harary,et al. Cospectral Graphs and Digraphs , 1971 .

[5] L. Collatz,et al. Spektren endlicher grafen , 1957 .

[6] Gottfried Tinhofer,et al. Linear time tree codes , 1984, Computing.

[7] A. Mowshowitz. The characteristic polynomial of a graph , 1972 .