The median function of a block graph: axiomatic characterizations
From MaRDI portal
Publication:6124436
DOI10.1016/j.dam.2024.01.040OpenAlexW4391765014MaRDI QIDQ6124436
G. Narasimha-Shenoi Prasanth, Gokul Krishna Gopakumar-Sheejakumari, Manoj Changat
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.040
Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An ABC-problem for location and consensus functions on graphs
- An axiomatization of the median procedure on the \(n\)-cube
- Medians and centres of polyominoes
- Characterizations of the plurality function
- An axiomatic characterization of some locations in trees
- The majority strategy on graphs
- The median procedure on median graphs
- Axiomatic characterization of the center function. The case of non-universal axioms
- A tight axiomatization of the median procedure on median graphs
- Handbook of social choice and welfare. Vol. 1.
- Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
- The center function on trees
- Graphs with Connected Medians
- AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES
- Location Theory
- An Axiomatic Approach to Location on Networks
- Quasi‐median graphs and algebras
- The ℓp‐function on trees
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs
- A survey of sequences of central subgraphs
- Five axioms for location functions on median graphs
- Centrality measures in networks
This page was built for publication: The median function of a block graph: axiomatic characterizations
