Centers and medians of distance-hereditary graphs

Discrete Mathematics

Volumn 265, Issue 1-3, 2003, Pages 297-310

  Yeh, Hong Gwa ^a   Chang, Gerard J ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Center; Chordal graph; Diameter; Distance; Distance hereditary graph; Eccentricity; Median; Ptolemaic graph; Radius

Indexed keywords

EID: 84867936259     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00630-1     Document Type: Article

References (42)

1. H.J. Bandelt, J.P. Barthelemy, Medians in median graphs, Discrete Appl. Math. 8 (1984) 131-142.
2. H.J. Bandelt, H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory, Ser. B 41 (1986) 182-208.
3. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Reading, MA, 1990.
4. F. Buckley, Z. Miller, P.J. Slater, On graphs containing a given graph as center, J. Graph Theory 5 (1981) 427-434.
5. G.J. Chang, Centers ofchordal graphs, Graph Combin. 7 (1991) 305-313.
6. G. Chartrand, G.L. Johnson, S. Tion, S.J. Winters, Directed distance in digraphs: centers and medians, J. Graph Theory 17 (1993) 509-521.
7. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
8. A. D'Atri, M. Moscarini, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput. 17 (1988) 521-538.
9. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
10. R.C. Entringer, D.E. Jackson, D.A. Snyder, Distance in graphs, Czech. Math. J. 26 (1976) 283-296.
11. M. Farber, On diameters and radii ofbridged graphs, Discrete Math. 73 (1989) 249-260.
12. M. Farber, R.E. Jamison, On local convexity in graphs, Discrete Math. 66 (1987) 231-247.
13. P.H. Hammer, F.Maray, Completely separable graphs, Discrete Appl. Math. 27 (1990) 85-99.
14. F. Harary, P. Ostrand, The cutting center theorem for trees, Discrete Math. 1 (1971) 7-18.
15. S.M. Hedetniemi, S.T. Hedetniemi, P.J. Slater, Centers and medians of C(N)-trees, Utilitas Math. 21C (1982) 225-234.
16. E. Howorka, A characterization ofdistance-hereditary graphs, Quart. J. Math. Oxford (2) 28 (1977) 417-420.
17. E. Howorka, A characterization ofPtolemaic graphs, J. Graph Theory 5 (1981) 323-331.
18. C. Jordan, Sur les assemblages des lignes, J. Reine Angew. Math. 70 (1869) 185-190.
19. R. Laskar, D. Shier, On powers and centers ofchordal graphs, Discrete Appl. Math. 6 (1983) 139-147.
20. H.Y. Lee, G.J. Chang, The w-median ofa connected strongly chordal graph, J. Graph Theory 18 (1994) 673-680.
21. H.Y. Lee, G.J. Chang, Medians ofgraphs and kings oftournaments, Taiwanese J. Math. 1 (1997) 103-110.
22. H.Y. Lee, G.J. Chang, Linear algorithms for w-medians ofgraphs, JCMCC 31 (1999) 183-192.
23. Y. Metivier, N. Saheb, Medians and centres ofpolyominoes, Inform. Process. Lett. 57 (1996) 175-181.
24. C.A. Morgan, P.J. Slater, A linear algorithm for a core of a tree, J. Algorithms 1 (1980) 247-258.
25. J. Nieminen, The center and the distance center ofa Ptolemaic graph, Oper. Res. Lett. 7 (1988) 91-94.
26. A. Proskurowski, Centers ofmaximal outplanar graphs, J. Graph Theory 4 (1980) 75-79.
27. A. Proskurowski, Centers of2-trees, Ann. Discrete Math. 9 (1980) 1-5.
28. P.J. Slater, Maximin facility location, J. Res. Nat. Bur. Standards, Sect. B 79(3,4) (1975) 107-115.
29. P.J. Slater, Central vertices in a graph, in: F. Ho@man, et al. (Eds.), Proceedings ofthe Seventh Southeast Conference on Combinatorial Graph Theory and Computing, Utilitas Math. Publishing, Winnepeg, 1976.
30. P.J. Slater, Structure ofthe k-centra ofa tree, Congressus Numer. 21 (1978) 663-670.
31. P.J. Slater, Centers to centroids in graphs, J. Graph Theory 2 (1978) 209-222.
32. P.J. Slater, Medians ofarbitrary graphs, J. Graph Theory 4 (1980) 389-392.
33. P.J. Slater, Centrality ofpaths and vertices in a graph: cores and pits, in: G. Chartrand, et al. (Eds.), Theory and Applications ofGraphs, Fourth International Conference, Wiley, New York, 1980.
34. P.J. Slater, Some deMnitions ofcentral structures, Lecture Notes in Math. 1073 (1983) 169-178.
35. V.P. Soltan, d-Convexity in graphs, Dokl. Akad. Nauk SSSR 272 (1983) 535-537 (English transl. in Soviet Math. Dokl. 28 (1983) 419-421).
36. V.P. Soltan, V.D. Chepoi, Mat. Issled. Vyp 78 (1984) 105-124 (in Russian).
37. H. Wittenberg, Local medians in chordal graphs, Discrete Appl. Math. 28 (1990) 287-296.
38. S.V. Yushmanov, On metric properties ofchordal and Ptolemaic graphs, Soviet Math. Dokl. 37 (1988) 665-668.
39. S.V. Yushmanov, A Simple relationship between the diameter and the radius ofa graph, Vestnik Moskov. Univ. Mat. 43 (1988) 58-60.
40. S.V. Yushmanov, On m-convexity and centers ofchordal graphs, Vestnik Moskov. Univ. Mat. 43 (1988) 78-80.
41. S.V. Yushmanov, A general method ofestimating metric characteristics ofa graph that are associated with eccentricity, Soviet Math. Dokl. 39 (1989) 460-462.
42. B. Zelinka, Medians and peripherians oftrees, Arch. Math. (Brno) 4 (1968) 87-95.