Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs

DOI10.1007/978-3-319-14974-5_14zbMath1435.05064OpenAlexW1498731007MaRDI QIDQ5174957

Ajitha R. Subhamathi, Henry Martyn Mulder, Manoj Changat, Divya Sindhu Lekha

Publication date: 19 February 2015

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

Full work available at URL: http://repub.eur.nl/pub/77639

zbMATH Keywords

consistencymediancomplete graphconsensus axiomconsensus functioncocktail-party graphantimedian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

Graphs with sparsity order at most two: the complex case ⋮ Axiomatic characterization of the median and antimedian function on a complete graph minus a matching