The ℓp-function on finite Boolean lattices
From MaRDI portal
Publication:2821108
DOI10.1142/S1793830916500440zbMath1345.05013OpenAlexW2346799035MaRDI QIDQ2821108
Carlos García-Martínez, K. Adamski, O. Ortega
Publication date: 16 September 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830916500440
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Logical aspects of lattices and related structures (03G10) Discrete location and assignment (90B80) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Lattices (06B99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An axiomatization of the median procedure on the \(n\)-cube
- An axiomatic characterization of some locations in trees
- The median procedure on median graphs
- The median function on distributive semilattices
- A tight axiomatization of the median procedure on median graphs
- Handbook of social choice and welfare. Vol. 1.
- The center function on trees
- An Axiomatic Characterization of a Class of Locations in Tree Networks
- THE MEDIAN FUNCTION ON TREES
- The median function on Boolean lattices
- AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES
- An Axiomatic Approach to Location on Networks
- A Formal Theory of Consensus
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- The ℓp‐function on trees
This page was built for publication: The ℓp-function on finite Boolean lattices