Centers and medians of distance-hereditary graphs

A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. In this paper, we study metric properties of distance-hereditary graphs. In particular, we determine the structures of centers and medians of distance-hereditary and related graphs. The relations between eccentricity, radius, and diameter of such graphs are also investigated.

[1]  Marina Moscarini,et al.  Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..

[2]  Heiko Wittenberg,et al.  Local medians in chordal graphs , 1990, Discret. Appl. Math..

[3]  Gary Chartrand,et al.  Directed distance in digraphs: Centers and medians , 1993, J. Graph Theory.

[4]  Douglas R. Shier,et al.  On powers and centers of chordal graphs , 1983, Discret. Appl. Math..

[5]  Martin Farber,et al.  On local convexity in graphs , 1987, Discret. Math..

[6]  Yves Métivier,et al.  Medians and Centres of Polyominoes , 1996, Inf. Process. Lett..

[7]  Peter J. Slater,et al.  Maximin facility location , 1975 .

[8]  Peter J. Slater,et al.  A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[9]  P. J. Slater.  Centrality of paths and vertices in a graph: cores and pits , 1980 .

[10]  Peter J. Slater,et al.  Medians of arbitrary graphs , 1980, J. Graph Theory.

[11]  Martin Farber,et al.  On diameters and radii of bridged graphs , 1989, Discret. Math..

[12]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[13]  C. Jordan.  Sur les assemblages de lignes. , 1869 .

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

[15]  Edward Howorka.  A characterization of ptolemaic graphs , 1981, J. Graph Theory.

[16]  Gerard J. Chang.  Centers of chordal graphs , 1991, Graphs Comb..

[17]  Zevi Miller,et al.  On graphs containing a given graph as center , 1981, J. Graph Theory.

[18]  Hans-Jürgen Bandelt,et al.  Medians in median graphs , 1984, Discret. Appl. Math..

[19]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[20]  Andrzej Proskurowski,et al.  Centers of 2–Trees , 1980 .

[21]  Peter L. Hammer,et al.  Completely separable graphs , 1990, Discret. Appl. Math..

[22]  Ignacio M. Pelayo,et al.  On convexity in graphs , 2004 .

[23]  Peter J. Slater,et al.  Centers to centroids in graphs , 1978, J. Graph Theory.

[24]  Juhani Nieminen,et al.  The center and the distance center of a ptolemaic graph , 1988 .

[25]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.

[26]  Frank Harary,et al.  The cutting center theorem for trees , 1971, Discret. Math..

[27]  Gerard J. Chang,et al.  The w-median of a connected strongly chordal graph , 1994, J. Graph Theory.

[28]  Gerard J. Chang,et al.  MEDIANS OF GRAPHS AND KINGS OF TOURNAMENTS , 1997 .

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

[30]  G. Dirac.  On rigid circuit graphs , 1961 .