The majority strategy on graphs Original Research Article

In a tree one can find the median set of a profile simply by starting at an arbitrary vertex and then moving to the majority of the profile. This strategy is formulated for arbitrary graphs. The graphs for which this strategy produces always the median set M(π), for each profile π, are precisely the median graphs.