Iterative procedure for the generalized graph center in polycyclic graphs

An improvement in the algorithm for assigning vertex(es) as graph center(s) is achieved on the basis of the distances between vertexes and between edges, as well as proceeding from the vertex-edge incidence. The iterative vertex and edge centricities (IVEC) algorithm produces assignments that are in better agreement with the intuitive notion of graph center than those produced by the previous procedures.

[1]  Thomas L. Isenhour,et al.  Minimal spanning tree clustering of gas chromatographic liquid phases , 1977, Comput. Chem..

[2]  A. Balaban,et al.  Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). I. Algorithms for finding graph orbits and canonical numbering of atoms , 1985 .

[3]  Bohdan Zelinka,et al.  Medians and peripherians of trees , 1968 .

[4]  Robert E. Stobaugh.  Chemical substructure searching , 1985, J. Chem. Inf. Comput. Sci..

[5]  Frank Harary,et al.  Distance in graphs , 1990 .

[6]  Danail Bonchev,et al.  The concept for the centre of a chemical structure and its applications , 1989 .

[7]  Danail Bonchev,et al.  Generalization of the Graph Center Concept, and Derived Topological Centric Indexes , 1980, J. Chem. Inf. Comput. Sci..

[8]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[9]  Ronald C. Read,et al.  A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds , 1983, J. Chem. Inf. Comput. Sci..

[10]  Danail Bonchev,et al.  The graph center concept for polycyclic graphs , 1981 .

[11]  D. Bonchev.  Principles of a novel nomenclature of organic compounds , 1983 .

[12]  Danail Bonchev,et al.  Graph theoretical classification and coding of chemical reactions with a linear mechanism , 1982 .

[13]  N. S. Sridharan,et al.  Applications of Artificial Intelligence for Chemical Inference. 12. Exhaustive Generation of Cyclic and Acyclic Isomers , 1973 .