Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions

DOI10.1016/0012-365X(94)00165-FzbMath0838.05057OpenAlexW2047225537MaRDI QIDQ1910516

Weizhen Gu, K. Brooks Reid

Publication date: 24 March 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00165-f

zbMATH Keywords

treedigraphsoriented graphanti-directed path

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Plurality preference digraphs realized by trees. II: On realization numbers

Cites Work

• Plurality preference digraphs realized by trees. II: On realization numbers
• Centers to centroids in graphs
• Realization of digraphs by preferences based on distances in graphs
• Unnamed Item

This page was built for publication: Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions