Abstract
The true nature of the extended connectivity, used in Morgan algorithm for the canonical numerotation of points in chemical graphs, is discussed. An alternative method for its calculation based on the number of walks is described and shown to yield results identical to Morgan's method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Morgan, H. L.: J. Chem. Doc.5, 107 (1965)
Wipke, W. T., Dyott, T. M.: J. Am. Chem. Soc.96, 4834 (1974)
Moreau, G.: Nouv. J. Chim.4, 17 (1980)
Harary, F.: Graph Theory, Reading, Mass: Addison-Wesley, 1969
Golender, V. E., Drboglav, V. V., Rosenblit, A. B.: J. Chem. Inf. Comput. Sci.21, 196 (1981)
Razinger, M., Chrétien, J., Dubois, J. E.: J. Chim. Phys. (submitted)
Deo, N.: Graph theory with applications to engineering and computer science, Englewood Cliffs, N.J.: Prentice-Hall, 1974
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Razinger, M. Extended connectivity in chemical graphs. Theoret. Chim. Acta 61, 581–586 (1982). https://doi.org/10.1007/BF02394734
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02394734