The Permanental Polynomial
暂无分享,去创建一个
[1] Gordon G. Cash. A fast computer algorithm for finding the permanent of adjacency matrices , 1995 .
[2] Fuji Zhang,et al. Concealed Non-Kekul.acte.ean Benzenoids , 1995, J. Chem. Inf. Comput. Sci..
[3] Nenad Trinajstić,et al. Kekulé structures and topology , 1972 .
[4] Jerry Ray Dias. Resonance structures of benzenoid conjugated radicals , 1999 .
[5] Albert Nijenhuis,et al. Combinatorial Algorithms for Computers and Calculators , 1978 .
[6] Huaiyu Zhu,et al. Many-body valence-bond theory , 1997 .
[7] Russell Merris,et al. Permanental polynomials of graphs , 1981 .
[8] Jerry Ray Dias. Facile calculations of the characteristic polynomial and π-energy levels of molecules using chemical graph theory , 1987 .
[9] Douglas J. Klein,et al. Variational localized-site cluster expansions , 1976 .
[10] Gordon G. Cash. A Simple Program for Computing Characteristic Polynomials with Mathematica , 1999, J. Chem. Inf. Comput. Sci..
[11] D. J. Klein. Variational localized-site cluster expansions: V. Valence-bond and Heisenberg models , 1976 .
[12] V. Rich. Personal communication , 1989, Nature.
[13] Jerry Ray Dias. Facile calculations of select eigenvalues and the characteristic polynomial of small molecular graphs containing heteroatoms , 1987 .
[14] Gordon G. Cash. A Simple Means of Computing the Kekulé Structure Count for Toroidal Polyhex Fullerenes , 1998, J. Chem. Inf. Comput. Sci..
[15] Ralph Kallman,et al. A method for finding permanents of 0,1 matrices , 1982 .
[16] Krishnan Balasubramanian,et al. Graph-theoretical Characterization of Fullerene Cages , 1993 .