The majority strategy on graphs

DOI10.1016/S0166-218X(97)00072-3zbMath0888.05025OpenAlexW2037621197WikidataQ127125149 ScholiaQ127125149MaRDI QIDQ1377621

Henry Martyn Mulder

Publication date: 1 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

profileintervalmedian graphmedian setmajority strategy

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph theory (05C99)

Related Items

Medians in median graphs and their cube complexes in linear time ⋮ Axiomatic characterization of the median function of a block graph ⋮ Median sets and median number of a graph ⋮ The median function of a block graph: axiomatic characterizations ⋮ AXIOMATIC CHARACTERIZATION OF THE ANTIMEDIAN FUNCTION ON PATHS AND HYPERCUBES ⋮ The median game ⋮ On the remoteness function in median graphs ⋮ Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom ⋮ The median function on graphs with bounded profiles ⋮ What Do Trees and Hypercubes Have in Common? ⋮ Five axioms for location functions on median graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Medians in median graphs
• The structure of median graphs
• Median graphs and Helly hypergraphs
• The median procedure on median graphs
• On the complexity of recognizing Hamming graphs and related classes of graphs
• Metric Ternary Distributive Semi-Lattices