On distances in benzenoid systems

Journal of Chemical Information and Computer Sciences

Volumn 36, Issue 6, 1996, Pages 1169-1172

  Chepoi, Victor ^a,b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b Universitatea de Stat din Moldova   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000367441     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci9600869     Document Type: Article

References (15)

1. Trinajstić, N. Chemical Graph Theory, 2nd revised ed.; CRC Press: Boca Raton, FL, 1992.
2. Bonchev, D.; Rouvray, D. H. Chemical Graph Theory. Introduction and Fundamentals; Abacus Press: New York, 1991.
3. Bonchev, D.; Balaban, A. T.; Mekenyan, O. Generalization of the graph centre concept and derived topological centric indices. J. Chem. Inf. Comput. Sci. 1980, 20, 106-113.
4. Bonchev, D.; Balaban, A. T.; Randić, M. The graph center concept for polycyclic graphs. Internat. J. Quantum Chem. 1981, 19, 61-82.
5. Bonchev, D.; Balaban, A. T. Topological centric coding and nomenclature of polycyclic hydrocarbons. I. Condenced benzenoid systems (polyhexes, fusenes). J. Chem. Inf. Comput. Sci. 1981, 21, 223-229.
6. Bonchev, D.; Mekenyan, O.; Balaban, A. T. Iterative procedure for the generalized graph center in polycyclic graphs. J. Chem. Inf. Comput. Sci. 1989, 29, 91-97.
7. Bonchev, D.; Balaban, A. T. Central vertices versus central rings in polycyclic systems. J. Math. Chem. 1993, 14, 287-304.
8. Balaban, A. T. Chemical graphs: looking back and glimpsing ahead. J. Chem. Inf. Comput. Sci. 1995, 35, 339-350.
9. Elk, S. B. A canonical ordering of polybenzenes and polymantes using prime number factorization technique. J. Math. Chem. 1990, 4, 55-68.
10. Elk, S. B. Graph theoretical algorithm to canonically name the isomers of the regular polyhedranes. J. Chem. Inf. Comput. Sci. 1992, 32, 14-22.
11. Klavžar, S.; Gutman, I.; Mohar B. Labeling of benzenoid systems which reflects the vertex-distance relations. J. Chem. Inf. Comput. Sci. 1995, 35, 590-593.
12. Harel, D.; Tarjan, R. E. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 1984, 13, 338-355.
13. Aggarwal, A.; Klawe, M.; Moran, S.; Shor, P.; Wilber, R. Geometric applications of a matrix searching algorithm. Algorithmica 1987, 2, 195-208.
14. Chazelle, B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 1994, 6, 485-524.
15. Hershberger, J.; Suri, S. Matrix searching with the shortest path metric. Technical Report 1993, 37.