Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Atomic, Molecular and Optical Physics  (3)
  • Putative substance P antagonists  (1)
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: General structures represented by graphs with unequal interactions (weighted edges) are considered and their characteristic polynomials (spectral polynomials) are obtained. It is shown that the procedure based on pruning terminal vertices previously developed by one of the present authors (K.B., Ref. 1) can be generalized to more common graphs in which nonuniform interactions (unequal couplings) occur. Special cases of the present approach are Möbius graphs, signed graphs, directed graphs, multigraphs, and pseudographs (i.e., graphs with multiple connections and graphs with loops, respectively). Weighted graphs (with general weights) are applicable to a variety of chemical problems such as problems of chemical kinetics, analysis of NMR spectra, the study of simple molecular orbitals, and molecular vibrations.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The problem of a mathematical description of objects showing individual structural variations but belonging to an apparently homogeneous population is considered. As an illustration a characterization of neuronal dendritic fields is outlined. The scheme views a neuron as a graph and is concerned with the characterization of the branching mode of derived graphs. The basic graph invariants considered are distances between all end points, which are enumerated and combined in a sequence. Some properties of the codes are discussed and their use for a classification of objects is illustrated.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 0020-7608
    Keywords: Computational Chemistry and Molecular Modeling ; Atomic, Molecular and Optical Physics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: A recursive method for enumeration of linearly independent and minimal conjugated circuits of benzenoid hydrocarbons had previously been given which is valid for several classes of benzenoid hydrocarbons. In the present article, the properties and constructions of unique minimal conjugated circuits and pairs of minimal conjugated circuits of a ring s in a benzenoid hydrocarbon B are investigated. An analytical expression for the count of LM-conjugated circuits of B is given which is based on the counts of Kekulé structures of selected subgraphs of B. By using the method, the LMC expression of any benzenoid hydrocarbon can be obtained. © 1996 John Wiley & Sons, Inc.
    Additional Material: 16 Ill.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Peptides 9 (1988), S. 651-660 
    ISSN: 0196-9781
    Keywords: Cat spinal cord ; Putative substance P antagonists ; Rat spinal cord slice ; Spinal dorsal horn neurons
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology
    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...