I
-
Published:2001
Issue:
Volume:
Page:197-215
-
ISSN:
-
Container-title:Encyclopaedia of Mathematics, Supplement III
-
language:
-
Short-container-title:
Publisher
Springer Netherlands
Reference45 articles.
1. Botti, Ph., and Merris, R.: ‘Almost all trees share a complete set of immanantal polynomials’, J. Graph Th. 17,no. 4 (1993), 467–476. 2. Burgisser, P.: ‘The computational complexity of immanants’, SIAM J. Comput. (to appear). 3. Brualdi, R.A., and Goldwasser, J.L.: ‘Permanent of Laplacian matrix of trees and bipartite graphs’, Discr. Math. 48 (1984), 1–21. 4. Chan, O., Gutman, I., Lam, Tao-Kai, and Merris, R.: ‘Algebraic connections between topological indices’, J. Chemical Inform. & Computer Sci. 38,no. 1 (1998), 62–65. 5. Chan, O., and Lam, T.K.: ‘Hook immanantal inequalities for trees explained’, Linear Alg. & Its Appl. 273 (1998), 119–131.
|
|