zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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 majority strategy on graphs. (English) Zbl 0888.05025
An interval I(u,v) in a graph G, where u, v are vertices, is the set of all vertices w of G for which the equality d(u,w)+d(w,v)=d(u,v) holds, where d denotes the distance. If for any three vertices u, v, w of G the intersection I(u,v)I(v,w)I(w,u) consists of one vertex only, then G is called a median graph. A profile of length p on a graph G is a finite sequence v 1 ,v 2 ,,v p of vertices of G; its median is a vertex x of G for which i=1 p d(x,v i ) is minimal. The set of all medians of a profile π is the median set M(π). In the paper a strategy for finding M(π) for a given profile π is described; it is called the majority strategy. It begins in a vertex of G and consists of certain successive moves from one vertex to another along an edge. It is proved that the majority strategy produces the median set M(π) for each profile π of G, independently of the initial position, if and only if G is a median graph.

05C12Distance in graphs
05C75Structural characterization of families of graphs
05C99Graph theory
90B80Discrete location and assignment