Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 6 (1985), S. 656-661 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: It is shown that the Frame's method (also, Le Verrier-Faddeev's method) for characteristic polynomials of chemical graphs can be extended to periodic graphs and structures. The finite periodic structures are represented by cyclic structures in the Born-von Kárman boundary condition which leads to complex matrices. In this article we demonstrate that our earlier computer program (based on Frame's method) can be extended to these periodic networks. The characteristic polynomials of several lattices such as polydiacetylenes, one-dimensional triangular, square, and hexagonal lattices are obtained. These polynomials can be obtained with very little computer time using this method.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: An algorithm is developed for generating and characterizing carcinogenic catacondensed benzenoid hydrocarbons. The bay regions in these structures are identified by a technique that we developed at Johns Hopkins. Using the three-digit code proposed by Balaban, and the concept of ring adjacency matrix expounded here, we generate catacondensed benzenoid hydrocarbons in the computer and identify the number of potentially carcinogenic bay regions in each of them. The results of computer generation agree with the combinatorial enumeration of Harary and Read. All structures containing up to five rings and some with six rings and the number of bay regions in these are presented. Computer results for the structures and bay regions of all seven-, eight-, and nine-membered unbranched catacondensed benzenoid hydrocarbons and the number of bays are available from the authors.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 3 (1982), S. 69-74 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: This article develops a set of algorithms for the computer generation of nuclear spin species and nuclear spin statistical weights potentially useful in molecular spectroscopy. These algorithms generate the nuclear spin species from group structures known as generalized character cycle indices (GCCIs). Thus the required input for these algorithms is just the set of all GCCIs for the symmetry group of the molecule which can be computed easily from the character table. The algorithms are executed and illustrated with examples.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 3 (1982), S. 75-88 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: This article develops computer programs for computer generation of nuclear spin species and nuclear spin statistical weights of rovibronic levels. The programs developed here generate nuclear spin species and statistical weights from the group structures known as generalized character cycle indices (GCCIs) which are computed easily from the character table of the PI group of the molecule under consideration. Procedures are illustrated with examples.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 5 (1984), S. 387-394 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: 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 vertices that are neighbors of a given vertex and with labels smaller than the label of that vertex. The program generates and stores only the lower triangle of the adjacency matrix in canonical ordering in a one-dimensional array. The program is written in integer arithmetic, and it can be easily modified to real arithmetic. The coefficients in the characteristic polynomials of several graphs were generated in less than a few seconds, thus solving the difficult problem of generating characteristic polynomials of graphs. The characteristic polynomials of a number of very complicated graphs are obtained including for the first time the characteristic polynomial of an honeycomb lattice graph containing 54 vertices.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 6 (1985), S. 122-141 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: A computer program in Pascal is developed for computing the matching polynomials of graphs and lattices. This program is based on the recursive relation for matching polynomials outlined by Hosoya [Bull. Chem. Soc. Jpn., 44, 2332 (1971)], Gutman and Hosoya [Theor. Chim. Acta, 48, 279 (1978)], and others. The graph whose matching polynomial is of interest is reduced recursively until the graph reduces to several trees. The characteristic polynomial of a tree is the same as the matching polynomial. The characteristic polynomials of resulting trees are computed using the computer program based on Frame's method developed by Balasubramanian [Theor. Chim. Acta, 65, 49 (1984)]; J. Comput. Chem., 5, 387 (1984). The resulting polynomials are then assembled to compute the matching polynomial of the initial graph. The program is especially useful in generating the matching polynomials of graphs containing a large number of vertices. The matching polynomials thus generated are potentially useful in several applications such as lattice statistics (dimer covering problem), aromaticity, valence bond methods (enumeration of perfect matchings) in the calculation of grand canonical partition functions, in the computation of thermodynamic properties of saturated hydrocarbons, and in chemical documentation.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 12 (1991), S. 106-112 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: A vectorized computer code is developed for the enumeration of walks through the matrix power method for directed graphs. Application of this code to several graphs is considered. It is shown that the coefficients in the generating functions for signed graphs are much smaller in magnitude. It is shown that self-avoiding walks on some graphs can be enumerated as a linear combination of walk GFs of directed paths and rooted-directed paths.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 10 (1989), S. 417-425 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: Algorithms and codes based on the method of Schur functions and Frobenius' theorem are used to generate the character tables of the symmetric groups (Sn) containing n! elements. The codes developed can generate characters of Sn up to n = 20.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 9
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: The computer code developed previously (K. Balasubramanian, J. Computational Chem., 5, 387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and signed graphs. This extension leads to a number of important applications of this code to several areas such as chemical kinetics, statistical mechanics, quantum chemistry of polymers, and unsaturated systems containing heteroatoms which include bond alternation. The characteristic polynomials of several edgeweighted graphs which may represent conjugated systems with bond alternations, heterographs (molecules with heteroatoms), directed graphs (chemical reaction network), and signed graphs and lattices are obtained for the first time.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 9 (1988), S. 406-415 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: A computer code based on the Givens-Householder matrix diagonalization method is used to calculate the spectra of graphs containing a large number of vertices. The code is most general in that it can handle graphs containing 200 or more vertices. Further, the code can be used to generate the spectra of weighted graphs. The program requires as input only the neighborhood table of the graph. The spectra of many graphs are generated for the first time in less than a few minutes of computer time. Applications to a number of chemical systems including two forms (foot and hand) of the recently synthesized C60 cluster and the effect of bond alternation on these systems are discussed. In addition, the spectra of square and honeycomb lattices and the characteristic polynomials of the foot and hand forms of the C60 cluster are obtained.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...