Abstract
This paper discusses the finding of vertex to vertex distances in molecular graphs. Having found these distances. one can obtain a method for canonical numbering of the atoms in a molecule, which depends on the atomic properties and the distances between equivalence classes. This does not use the traditional Morgan algorithm. Using distances one can also perceive rings. Finally, substructures of interest can be detected using distances between the central atoms of various functional groups. The set of vertex distances are thus a kind of lens for examination of the graph properties of molecules. Applications have thus far been only in organic chemistry. Application to physical chemistry may appear wherever molecular graphs can be helpful, such as in calculations concerning molecules of high symmetry.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
