Labeling and ordering the paths

Part of the Lecture Notes in Chemistry book series (LNC, volume 42)


Smaller model spaces, i.e spaces of a smaller number of orbitals n′ ≤ n or particles, N′ ≤ N, are represented by subgraphs embedded in a natural way in G2(2n: N), with (N′,2n′) vertex as their tail. Similarly one can imagine larger graphs in which G2(2n: N) is embedded. Description of the borders of a graph is simpler if we regard vertices and arcs of these larger graphs as ‘virtually present’: existing, but giving a null contribution to the real graph. The fixed-slope graphs, by virtue of this embedding property, admit a natural ordering of paths.


Model Space Spin Orbital Large Graph Letter Sequence Real Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • W. Duch
    • 1
    • 2
  1. 1.Max-Planck-Institut für Physik und AstrophysikGarching bei MünchenDeutschland
  2. 2.Instytut FizykiUMKToruńPoland

Personalised recommendations