A tight axiomatization of the median procedure on median graphs
From MaRDI portal
Publication:1946227
DOI10.1016/j.dam.2012.10.027zbMath1262.05041OpenAlexW1999957467MaRDI QIDQ1946227
Beth Novick, Henry Martyn Mulder
Publication date: 18 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.027
Extremal problems in graph theory (05C35) Discrete location and assignment (90B80) Distance in graphs (05C12)
Related Items
Medians in median graphs and their cube complexes in linear time, Axiomatic characterization of the median function of a block graph, An ABC-problem for location and consensus functions on graphs, Graphs with \(G^p\)-connected medians, The median function of a block graph: axiomatic characterizations, Axioms for consensus functions on the \(n\)-cube, Axiomatic characterization of the center function. The case of non-universal axioms, Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom, The ℓp-function on finite Boolean lattices, What Do Trees and Hypercubes Have in Common?, Five axioms for location functions on median graphs, Axiomatic characterization of the center function. the case of universal axioms, Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
