Let G = (V (G), E(G)) be a simple graph of maximum degree โ โค D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) โช E(G) such that no adjacent or incident elements of S receive
An extension of the Coulson-Rushbrooke theorem
โ Scribed by N. Tyutyulkov; O.E. Polansky
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 329 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
It is shown that the Coulson-Rushbrooke theorem for odd altemant hydrocarbons and polymers can be extended to some classes of non-classical (non-KekulC) systems containing heteroatoms. The extension is only applicable to non-bonding molecular orbitals. The band structure of such polymers is analogous to that of odd altemant non-classical polymers, whose ground state is characterized by maximum spin multiplicity.
๐ SIMILAR VOLUMES
In his famous 1965 paper, Asher Wagner proves that if S is a finite affine plane and G a collineation group line transitive on S. then S is a translation atfine plane and G contains the translation group of S. In this paper, we generalize Wagner's assumptions to: S is an affine spfce embedded as a m