Skip to main content
SpringerLink
Log in

On the complexity of graphs and molecules

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

A new formula for the complexity of graphs is proposed and applied to the points lines and ‘connections’ of some chemically relevant graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature

  • Bertz, S. H. 1981a. “The First General Index of Molecular Complexity.”J. Am. Chem. Soc. 103, 3599–3601.

    Article  Google Scholar 

  • Bertz, S. H. 1981b. “The Bond Graph.”J. C. S. Chem. Commun. 818–820.

  • — 1982. “Convergence, Molecular Complexity, and Synthetic Analysis.”J. Am. chem. Soc. 104, 5801–5803.

    Article  Google Scholar 

  • Bonchev, D., D. Kamenski and V. Kamenska. 1976. “Symmetry and Information Content of Chemical Structures.”Bull. math. Biol. 38, 119–133.

    Article  Google Scholar 

  • —, Ov. Mekenyan and N. Trinajstić. 1980. “Topological Characterization of Cyclic Structures.”Int. J. Quantum Chem. 17, 845–893.

    Article  Google Scholar 

  • —— and —. 1981. “Isomer Discrimination by Topological Information Approach.”J. Comput. Chem. 2, 127–148.

    Article  MathSciNet  Google Scholar 

  • Gelernter, H., N. S. Sridharan, A. J. Hart, S.-C. Yen, F. W. Fowler and H.-J. Shue. 1973. “The Discovery of Organic Synthetic Routes by Computer.”,Top. Curr. Chem. 41, 113–150.

    Google Scholar 

  • Gordon, M. and J. W. Kennedy. 1973. “The Graph-like State of Matter.”J. C. S. Faraday Trans. II 69, 484–504.

    Article  Google Scholar 

  • Harary, F. 1969.Graph Theory. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Karreman, G. 1955. “Topological Information Content and Chemical Reactions.”Bull. math. Biophys. 17, 279–285.

    Google Scholar 

  • Mowshowitz, A. 1968. “Entropy and the Complexity of Graphs: I. An Index of the Relative Complexity of a Graph.”Bull. math. Biophys. 30, 175–204.

    MATH  MathSciNet  Google Scholar 

  • Orchin, M., F. Kaplan, R. S. Macomber, R. M. Wilson and H. Zimmer. 1980.The Vocabulary of Organic Chemistry. New York: John Wiley.

    Google Scholar 

  • Rashevsky, N. 1955. “Life, Information Theory, and Topology.”Bull. math. Biophys.17, 229–235.

    MathSciNet  Google Scholar 

  • Sabidussi, G. 1961. “Graph Derivatives.”Math. Z. 76, 385–401.

    Article  MATH  MathSciNet  Google Scholar 

  • Shannon, C. and W. Weaver. 1949.The Mathematical Theory of Communication. Urbana: University of Illinois Press.

    Google Scholar 

  • Trucco, E. 1956. “A Note on the Information Content of Graphs.”Bull. math. Biophys. 18, 129–135.

    MathSciNet  Google Scholar 

  • Tsukamoto, Y. 1979. “An Information Theory of the Genetic Code.”J. theor. Biol. 78, 451–498.

    Article  Google Scholar 

  • Wiener, H. 1947. “Structural Determination of Parafin Boiling Points.”J. Am. chem. Soc. 69, 17–20.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, 07974, Murray Hill, NJ, U.S.A.

    Steven H. Bertz

Authors
  1. Steven H. Bertz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bertz, S.H. On the complexity of graphs and molecules. Bltn Mathcal Biology 45, 849–855 (1983). https://doi.org/10.1007/BF02460054

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02460054

Keywords

Search

Navigation