×

Medians in median graphs. (English) Zbl 0536.05057

If G is an undirected graph, V(G) is its vertex set and \(A\subseteq V(G)\), then a median of A is any vertex of G which has the minimal sum of distance from all vertices of A. If each subset of V(G) having three vertices has exactly one median, then G is called a median graph. The properties of median graphs are studied. The interrelation between median graphs and median semilattices is shown; a median semilattice is a meet semilattice \((X,\leq)\) such that every principle ideal \(\{\) \(x| x\leq a\}\) is a distributive lattice and any three elements have an upper bound whenever each pair of them does. At the end of the paper the concept of a local median is introduced and interrelations between medians and Condorcet vertices are described.
Reviewer: B.Zelinka

MSC:

05C99 Graph theory
05C38 Paths and cycles
06A12 Semilattices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Avann, S. P., Metric ternary distributive semi-lattices, Proc. Amer. Math. Soc., 12, 407-414 (1961) · Zbl 0099.02201
[2] H.J. Bandelt, Discrete ordered sets whose covering graphs are median, Proc. Amer. Math. Soc., to appear.; H.J. Bandelt, Discrete ordered sets whose covering graphs are median, Proc. Amer. Math. Soc., to appear. · Zbl 0547.06001
[3] Bandelt, H. J.; Hedlíková, J., Median algebras, Discrete Math., 45, 1-30 (1983) · Zbl 0506.06005
[4] Barbut, M., Médiane, distributivité, éloignements, Math. Sci. Hum., 70, 5-31 (1980) · Zbl 0439.06007
[5] Barbut, M., Médianes, Condorcet et Kendall, Math. Sci. Hum., 69, 5-13 (1980) · Zbl 0437.90010
[6] Barthélemy, J. P., Trois proprietés des médianes dans un treillis modulaire, Math. Sci. Hum., 75, 83-91 (1981) · Zbl 0474.06011
[7] Barthélemy, J. P., Caractérisation médiane des arbres, Annals Discrete Math., 17, 39-46 (1983) · Zbl 0548.05022
[8] Barthélemy, J. P.; Monjardet, B., The median procedure in cluster analysis and social choice theory, Math. Social Sci., 1, 235-267 (1981) · Zbl 0486.62057
[9] Duffus, D.; Rival, I., Path length in the covering graph of a lattice, Discrete Math., 19, 139-158 (1977) · Zbl 0372.06005
[10] Evans, E., Median lattices and convex subalgebras, (Colloq. Math. Soc. János Bolyai, 29, Universal Algebra (1982), North-Holland: North-Holland Amsterdam), 225-240
[11] Hansen, P.; Thisse, J. F., Outcomes of voting and planning: Condorcet, Weber and Rawls locations, J. Public Economics, 16, 1-15 (1981)
[12] Jordan, C., Sur les assemblages de lignes, J. Reine Angew. Math., 70, 185-190 (1869) · JFM 02.0344.01
[13] Monjardet, B., Caractérisations métriques des ensembles ordonnés semi-modulaire, Math. Sci. Hum., 56, 77-87 (1976) · Zbl 0367.06010
[14] Monjardet, B., Théorie et applications de la médiane dans les treillis distributifs finis, Annals Discrete Math., 9, 87-91 (1980) · Zbl 0451.06012
[15] Mulder, H. M., The interval function of a graph, Academisch Proefschrift, Mathematisch Centrum (1980), Amsterdam · Zbl 0446.05039
[16] Mulder, H. M.; Schrijver, A., Median graphs and Helly hypergraphs, Discrete Math., 25, 41-50 (1979) · Zbl 0395.05058
[17] Sholander, M., Medians, lattices, and trees, Proc. Amer. Math. Soc., 5, 808-812 (1954) · Zbl 0056.26201
[18] Slater, P. J., Maximin facility location, J. Res. Nat. Bureau Standards, 79B, 107-115 (1975) · Zbl 0327.05105
[19] Slater, P. J., Centers to centroids in graphs, J. Graph Theory, 2, 209-222 (1978) · Zbl 0425.05021
[20] Slater, P. J., Medians of arbitrary graphs, J. Graph Theory, 4, 389-392 (1980) · Zbl 0446.05029
[21] Wendell, R. E.; McKelvey, R. D., New perspectives in competitive location theory, Europ. J. Oper. Res., 6, 174-182 (1981) · Zbl 0451.90043
[22] Zelinka, B., Medians and peripherians of trees, Archivum Math. (Brno), 4, 87-95 (1968) · Zbl 0206.26105
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.