The t-median function on graphs
2005-08-23
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ReportEI2005-31.pdf, 0.2MB) |
A median of a sequence = x1, x2, … , xk of elements of a finite metric space (X, d ) is an element x for which 1 ≤ I ≤ k d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M() = {x: x is a median of } is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(), a generalization of the median function is introduced and studied on various graphs and ordered sets. In addition, new results are presented for median graphs.
Keywords
Automatically Extracted Terms
- graph
- function
- profile
- split
- semilattice
- consensus
- t-condorcet
- proof
- theorem
- vertex
- element
- claim
- vertice
- graph g
- consensus function
- subgraph
- join-irreducible
- axiom
- neighbor
- result
