Molecular graph

Molecular graph

In chemical graph theory and in mathematical chemistry, a molecular graph or chemical graph is a representation of the structural formula of a chemical compound in terms of graph theory. A chemical graph is a labeled graph whose vertices correspond to the atoms of the compound and edges correspond to chemical bonds. Its vertices are labeled with the kinds of the corresponding atoms and edges are labeled with the types of bonds.[1] For particular purposes any of the labelings may be ignored.

A hydrogen-depleted molecular graph or hydrogen-suppressed molecular graph is the molecular graph with hydrogen vertices deleted.

Molecular graphs can distinguish between structural isomers, compounds which have the same molecular formula but non-isomorphic graphs - such as isopentane and neopentane. On the other hand, the molecular graph normally does not contain any information about the three-dimensional arrangement of the bonds, and therefore cannot distinguish between conformational isomers (such as cis and trans 2-butene) or stereoisomers (such as D- and L-glyceraldehyde).

In some important cases (topological index calculation etc.) the following classical definition is sufficient: molecular graph is connected undirected graph one-to-one corresponded to structural formula of chemical compound so that vertices of the graph correspond to atoms of the molecule and edges of the graph correspond to chemical bonds between these atoms.[2] One variant is to represent materials as infinite Euclidean graphs, in particular, crystals as periodic graphs.

History

Arthur Cayley was probably the first to publish results that consider molecular graphs as early as in 1874, even before the introduction of the term "graph".[3] For the purposes of enumeration of isomers, Cayley considered "diagrams" made of ponts labelled by atoms and connected by links into an assemblage. He further introduced the terms plerogram and kenogram, which are the molecular graph and the hydrogen-suppressed molecular graph respectively. If, further one continues to delete atoms connected by a single link, one arrives to a mere kenogram, possibly empty.[4]

Danail Bonchev in his Chemical Graph Theory traces the origins of representation of chemical forces by diagrams which may be called "chemical graphs" as early as to mid-18th century. In early 18th century, Isaac Newton's notion of gravity had led to speculative ideas that atoms are held together by some kind of "gravitational force". In particular, since 1758 Scottish chemist William Cullen in his lectures used what he called "affinity dagrams" to represent forces supposedly existing between pairs of molecules in a chemical reaction. In a 1789 book by William Higgins similar diagrams were used to represent forces within molecules. These and some other contemporary diagrams had no relation to chemical bonds: the latter notion was introduced only in the following century.[5]

References

  1. ^ IUPAC, Compendium of Chemical Terminology, 2nd ed. (the "Gold Book") (1997). Online corrected version:  (2006–) "molecular graph".
  2. ^ Chemical Applications of Topology and Graph Theory, ed. by R. B. King, Elsevier, 1983
  3. ^ A. Cayley, Philos. Mag., 1874, 47, 444-446, as quoted in N. L. Biggs, E. K. Lloyd and R. J. Wilson, "Graph Theory 1736-1936", Clarendon Press, Oxford, 1976; Oxford University Press, 1986, ISBN 0198539169
  4. ^ Biggs, LLoyd, Wilson, p. 61
  5. ^ Danail Bonchev (1991) "Chemical Graph Theory: Introduction and Fundamentals" ISBN 0856264547

Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Molecular graphics — (MG) is the discipline and philosophy of studying molecules and their properties through graphical representation.[1] IUPAC limits the definition to representations on a graphical display device .[2] Ever since Dalton s atoms and Kekulé s benzene …   Wikipedia

  • Molecular descriptor — Molecular descriptors play a fundamental role in chemistry, pharmaceutical sciences, environmental protection policy, and health researches, as well as in quality control, being the way molecules, thought of as real bodies, are transformed into… …   Wikipedia

  • Graph Modelling Language — (GML) is a hierarchical ASCII based file format for describing graphs. Applications supporting GML * Cytoscape, an open source bioinformatics software platform for visualizing molecular interaction networks, loads and save previously constructed… …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • GRaPH-Int — The Genome based Research and Population Health International Network (GRaPH Int) is an international collaboration of experts and researchers focused in the area of population health. The principal goal of the network is to promote the… …   Wikipedia

  • Periodic graph (crystallography) — For other uses, see Periodic graph. A (large) unit cell of Diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds …   Wikipedia

  • Simplified molecular input line entry specification — Infobox file format name = smiles extension = .smi mime = owner = creatorcode = genre = chemical file format container for = contained by = extended from = extended to = The simplified molecular input line entry specification or SMILES is a… …   Wikipedia

  • Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …   Wikipedia

  • Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”