# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
The median procedure on median graphs. (English) Zbl 0906.05023
An ordered $k$-tuple $\pi= (x_1,\dots, x_k)$ of elements of a finite metric space $(X, d)$ is called a profile. An element $x\in X$ for which $\sum^k_{i= 1}d(x, x_i)$ is minimum is called a median of $\pi$. The median procedure is the function $\text{Med}(\pi)= \{x\mid x$ is a median of $\pi\}$. These concepts are studied in the case when $X$ is the vertex set of a graph with the usual distance. In particular, they are studied for median graphs, i.e. connected graphs $G$ in which for any three vertices $x$, $y$, $z$ there is a unique vertex $w$ on the geodesic between each pair of $x$, $y$, $z$. Special attention is paid to cube-free median graphs.

##### MSC:
 05C12 Distance in graphs
##### Keywords:
profile; median; distance
Full Text:
##### References:
 [1] Avann, S. P.: Metric ternary distributive semi-lattices. Proc. amer. Math. soc. 12, 407-414 (1961) · Zbl 0099.02201 [2] Bandelt, H. J.: Discrete ordered sets whose covering graphs are medians. Proc. amer. Math. soc. 9, 6-8 (1984) · Zbl 0547.06001 [3] Bandelt, H. J.: Centroids and medians of finite metric spaces. J. graph theory 16, 305-317 (1992) · Zbl 0849.05027 [4] Bandelt, H. J.; Barthélemy, J. P.: Medians in median graphs. Discrete appl. Math. 8, 131-142 (1984) · Zbl 0536.05057 [5] Barthélemy, J. P.; Constantin, J.: Median graphs, parallelism and posets. Discrete math. 111, 49-63 (1993) · Zbl 0787.05027 [6] Barthélemy, J. P.; Janowitz, M. F.: A formal theory of consensus. SIAM J. Discrete math. 4, 305-322 (1991) · Zbl 0734.90008 [7] Barthélemy, J. P.; Leclerc, B.; Monjardet, B.: On the use of ordered sets in problems of comparison and consensus of classifications. J. classification 3, 187-224 (1986) · Zbl 0647.62056 [8] Barthélemy, J. P.; Mcmorris, F. R.: The median procedure for n-trees. J. classification 3, 329-334 (1986) · Zbl 0617.62066 [9] Barthélemy, J. P.; Monjardet, B.: The median procedure in cluster analysis and social choice theory. Math. social sci. 1, 235-268 (1981) · Zbl 0486.62057 [10] Jha, P. K.; Slutzki, G.: Convex-expansions algorithms for recognition and isometric embedding of median graphs. Ars combin. 34, 75-92 (1992) · Zbl 0770.05043 [11] Leclerc, B.: Medians and majorities in semimodular lattices. SIAM J. Discrete math. 3, 266-267 (1990) · Zbl 0698.06003 [12] Leclerc, B.: Lattice valuations, medians and majorities. Discrete math. 111, 345-356 (1993) · Zbl 0785.06006 [13] Mcmorris, F. R.; Powers, R. C.: The median procedure in a formal theory of consensus. SIAM J. Discrete math. 8, 507-516 (1995) · Zbl 0843.90008 [14] Monjardet, B.: Théorie et application de la médiane dans LES treillis distributifs finis. Ann. discrete math. 9, 87-91 (1980) · Zbl 0451.06012 [15] Mulder, H. M.: The structure of median graphs. Discrete math. 24, 197-204 (1978) · Zbl 0394.05038 [16] Mulder, H. M.: N-cubes and median graphs. J. graph theory 4, 107-110 (1980) · Zbl 0427.05046 [17] Mulder, H. M.: The interval function of a graph. Mathematical centre tract 132 (1980) · Zbl 0446.05039 [18] Mulder, H. M.: The expansion procedure for graphs. Contemporary methods in graph theory, 459-477 (1990) · Zbl 0744.05064 [19] Mulder, H. M.; Schrijver, A.: Median graphs and Helly hypergraphs. Discrete math. 25, 41-50 (1979) · Zbl 0395.05058 [20] Nebeský, L.: Median graphs. Comment. math. Univ. carolin. 12, 317-325 (1971) · Zbl 0215.34001 [21] Vohra, R. V.: An axiomatic characterization of some locations in trees. European J. Oper. res. 90, 78-84 (1996) · Zbl 0914.90182 [22] Young, H. P.; Levenglick, A.: A consistent extension of Condorcet’s election principle. SIAM J. Appl. math. 35, 285-300 (1978) · Zbl 0385.90010 [23] Zelinka, B.: A modification of the median of a tree. Math. bohemica 118, 195-200 (1993) · Zbl 0778.05030