On the Permanental Polynomials of Some Graphs
Authors:
- 1 March 2004
- journal article
- research article
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 35 (3) , 175-188
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computation of sparse circulant permanents via determinantsLinear Algebra and its Applications, 2002
- Permanental Polynomials of the Smaller FullerenesJournal of Chemical Information and Computer Sciences, 2000
- The Permanental PolynomialJournal of Chemical Information and Computer Sciences, 2000
- Permanents of Adjacency Matrices of FullerenesPolycyclic Aromatic Compounds, 1997
- Many-body valence-bond theoryInternational Journal of Quantum Chemistry, 1997
- A fast computer algorithm for finding the permanent of adjacency matricesJournal of Mathematical Chemistry, 1995
- A note on characteristic and permanental polynomials of multigraphs1983
- Permanental polynomials of graphsLinear Algebra and its Applications, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Variational localized-site cluster expansionsMolecular Physics, 1976