Realization of digraphs by preferences based on distances in graphs

DOI10.1002/JGT.3190190309MaRDI QIDQ4698086zbMATH OpenOpenAlexFDO

Authors Weizhen Gu, K. B. Reid, Walter Schnyder

Publication date 28 September 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190190309

zbMATH Keywords

asymmetric digraphcomputational complexitydistances

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Voting theory (91B12)

Recommendations

• scientific article; zbMATH DE number 4091537
• Plurality preference digraphs realized by trees. II: On realization numbers
• Voting paradoxes and digraphs realizations

Cited in

(5)

• Plurality preference digraphs realized by trees. II: On realization numbers
• Voting paradoxes and digraphs realizations
• Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions
• scientific article; zbMATH DE number 4091537 (Why is no real title available?)
• Euclidean preferences

This page was built for publication: Realization of digraphs by preferences based on distances in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698086)