Distances in benzenoid systems: Further developments

Discrete Mathematics

Volumn 192, Issue 1-3, 1998, Pages 27-39

  Chepoi, Victor ^a,c   Klavžar, Sandi ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF MARIBOR   (Slovenia)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001859036     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00064-8     Document Type: Article

References (28)

1. R.P. Anstee, M. Farber, On bridged graphs and cop-win graphs, J. Combin. Theory Ser. B 44 (1988) 22-28.
2. H.-J. Bandelt, V. Chepoi, Cellular bipartite graphs, European J. Combin. 17 (1996) 121-134.
3. H.-J. Bandelt, V. Chepoi, Generalized rectilinear polygons, in preparation.
4. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1994) 485-524.
5. V. Chepoi, On distances in benzenoid systems, J. Chem. Inform. Comput. Sci. 36 (1996) 1169-1172.
6. V. Chepoi, Bridged graphs are cop-win graphs: an algorithmic proof, J. Combin. Theory Ser. B 69 (1997) 97-100.
7. V. Chepoi, S. Klavžar, The Wiener index and the Szeged index of benzenoid systems in linear time, J. Chem. Inform. Comput. Sci. 37 (1997) 752-755.
8. R. Duda, P. Hart, Pattern Classification and Scene Analysis (Wiley Interscience, New York, 1973).
9. M. Farber, R.E. Jamison, On local convexity in graphs, Discrete Math. 66 (1987) 231-247.
10. A.J. Goldman, Optimal center location in simple networks, Transport. Sci. 5 (1971) 212-221.
11. R.L. Graham, P.M. Winkler, On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (1985) 527-536.
12. I. Gutman, S.J. Cyvin, Introduction to the Theory of Benzenoid Hydrocarbons, Springer, Berlin, 1989.
13. I. Gutman, S. Klavžar, An algorithm for the calculation of the Szeged index of benzenoid hydrocarbons, J. Chem. Inform. Comput. Sci. 35, (1995) 1011-1014.
14. I. Gutman, S. Klavžar, A Method for Calculating Wiener Numbers of Benzenoid Hydrocarbons, Models in Chemistry (Acta Chim. Hung.), in press.
15. I. Gutman, S. Klavžar, B. Mohar, (Eds.), Fifty Years of the Wiener Index, MATCH vol. 35, 1997, in press.
16. I. Gutman, Y.N. Yeh, S.L. Lee, Y.L. Luo, Some recent results in the theory of the Wiener number, Indian J. Chem. 32A (1993) 651-661.
17. D. Harel, R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
18. W. Imrich, S. Klavžar, On the complexity of recognizing Hamming graphs and related classes of graphs, European J. Combin. 17 (1996) 209-221.
19. A.K. Jain, R.C. Dubes, Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ, 1988.
20. S. Klavžar, I. Gutman, Wiener number of vertex-weighted graphs and a chemical application, submitted.
21. S. Klavžar, I. Gutman, B. Mohar, Labeling of benzenoid systems which reflects the vertex-distance relations, J. Chem. Inform. Comput. Sci. 35 (1995) 590-593.
22. B. Mohar, T. Pisanski, How to compute the Wiener index of a graph, J. Math. Chem. 2 (1988) 267-277.
23. S. Nikolić, N. Trinajstić, Z. Mihalić, The Wiener index: development and applications, Croat. Chem. Acta 68 (1995) 105-129.
24. D.R. Shier, P.M. Dearing, Optimal locations for a class of nonlinear, single-facility location problem on a network, Oper. Res. 31 (1983) 292-303.
25. V. Soltan, V. Chepoi, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics 19 (1983) 750-756.
26. A. Tamir, personal communication.
27. N. Trinajstić, Chemical Graph Theory, CRC Press, Boca Raton, FL, 1993.
28. H. Wiener, Structural determination of paraffin boiling points, J. Amer. Chem. Soc. 69 (1947) 17-20.