Graph presentation of molecular structures is widely used in computational chemistry and theoretical chemical research.'x2 Molecular structures are represented by graphs where vertices correspond to atoms and edges to chemical bonds. This kind of graph, called a molecular graph,' is the object of study in the theory of ordinary graph^.^ However ordinary graphs do not adequately describe chemical compounds of nonclassical structure. As noted in ref 4 a substantial drawback of the structure theory is the lack of a convenient representation for molecules with delocalized polycentric bonds. Organometallic compounds are one example of such structures.j Organometallic chemistry deals with compounds that have at least one metal-carbon (M-C) bond. This bond may be a simple covalent bond, as for example in Pb(C2Hj)4, but also may be an ionic bond, as for example in Na+CzHj-, or a n-bond, as for example in ferrocene, where iron has bonds with cyclopentadienyls, which are five-electron ligands. In principle any nonsaturated or aromatic organic molecule or radical can be a ligand in metal-carbon bond. Just the same molecule may play roles of different ligands. The variety of M-C bond types and ligands leads to the appearance of a considerable range of organometallic compounds and provides a basis for classification of these compound^.^ In Figure 1, examples of molecular structures for compounds with three-electron ligands are given. Let us consider some of the graph models used for representation of such compounds. In refs 6 and 7 examples of representation for "sandwich" and olefin structures by disconnected molecular graphs (see Figure 2a) are described. Representation 2a does not seem to be illustrative and does not allow us to analyze a structure as a whole, because there are no connections between molecular subgraphs representing individual structural fragments within it. More illustrative but still not devoid of drawbacks are connected molecular graphs where all the vertices corresponding to carbon atoms are connected to the M vertex, which corresponds to a metal atom (Figure 2b). If M = Fe, Ni the valency of the metal atom is equal two. The degree of the M vertex in this case is equal to the number of vertices connected and not necessarily equal to the valency of the M atom. Besides, in both representations the difference between simple covalent and polycentric bonds is obscured.
[1]
Ján Plesník,et al.
On the sum of all distances in a graph or digraph
,
1984,
J. Graph Theory.
[2]
Marko Razinger,et al.
Structural selectivity of topological indexes in alkane series
,
1985,
J. Chem. Inf. Comput. Sci..
[3]
Milan Randić,et al.
On the recognition of identical graphs representing molecular topology
,
1974
.
[4]
H. Wiener.
Structural determination of paraffin boiling points.
,
1947,
Journal of the American Chemical Society.
[5]
H. Wiener.
Vapor pressure-temperature relationships among the branched paraffin hydrocarbons.
,
1948,
The Journal of physical and colloid chemistry.
[6]
J. K. Doyle,et al.
Mean distance in a graph
,
1977,
Discret. Math..
[7]
N. Trinajstic,et al.
Information theory, distance matrix, and molecular branching
,
1977
.
[8]
Jiri Pospichal,et al.
Canonical indexing and constructive enumeration of molecular graphs
,
1990,
J. Chem. Inf. Comput. Sci..
[9]
Nenad Trinajstić,et al.
Isomer discrimination by topological information approach
,
1981
.
[10]
Alexandru T. Balaban,et al.
Topological indices based on topological distances in molecular graphs
,
1983
.
[11]
James B. Hendrickson,et al.
Unique numbering and cataloging of molecular structures
,
1983,
J. Chem. Inf. Comput. Sci..
[12]
Roger C. Entringer,et al.
Distance in graphs
,
1976
.
[13]
B. Heap.
THE PRODUCTION OF GRAPHS BY COMPUTER
,
1972
.