Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Characteristic polynomials  (1)
  • Rat spinal cord slice  (1)
  • 1
    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 ...
  • 2
    ISSN: 1432-2234
    Keywords: Graph theory ; Characteristic polynomials
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Abstract It is well known [1] that the calculation of characteristic polynomials of graphs of interest in Chemistry which are of any size is usually extremely tedious except for graphs having a vertex of degree 1. This is primarily because of numerous combinations of contributions whether they were arrived at by non-imaginative expansion of the secular determinant or by the use of some of the available graph theoretical schemes based on the enumeration of partial coverings of a graph, etc. An efficient and quite general technique is outlined here for compounds that have pending bonds (i.e., bonds which have a terminal vertex). We have extended here the step-wise pruning of pending bonds developed for acyclic structures by one of the authors [2] for elegant evaluation of the characteristic polynomials of trees by accelerating this process, treating pending group as a unit. Further, it is demonstrated that this generalized pruning technique can be applied not only to trees but to cyclic and polycyclic graphs of any size. This technique reduces the secular determinant to a considerable extent. The present technique cannot handle only polycyclic structures that have no pending bonds. However, frequently such structures can be reduced to a combination of polycyclic graphs with pending bonds [3] so that the present scheme is applicable to these structures too. Thus we have arrived at an efficient and quite a simple technique for the construction of the characteristic polynomials of graphs of any size.
    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...