Centers and medians of distance-hereditary graphs

Authors:
Hong-Gwa Yeh;Gerard J. Chang
Affiliations:
Department of Mathematics, National Central University, Chung-Li 320, Taiwan;Department of Mathematics, National Taiwan University, Taipei 106, Taiwan
Venue:
Discrete Mathematics
Year:
2003

Citing 9
Cited 7

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
On local convexity in graphs

Discrete Mathematics
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
On diameters and radii of bridged graphs

Discrete Mathematics
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Local medians in chordal graphs

Discrete Applied Mathematics
Directed distance in digraphs: centers and medians

Journal of Graph Theory
The w-median of a connected strongly chordal graph

Journal of Graph Theory
Medians and centres of polyominoes

Information Processing Letters

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

Computing
The median function on graphs with bounded profiles

Discrete Applied Mathematics
Laminar structure of ptolemaic graphs with applications

Discrete Applied Mathematics
Distance-hereditary digraphs

Journal of Discrete Algorithms
Laminar structure of ptolemaic graphs and its applications

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proximity and average eccentricity of a graph

Information Processing Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.