✦ LIBER ✦

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

✍ Scribed by Irène Charon; Olivier Hudry

Publisher: Springer Netherlands
Year: 2010
Tongue: English
Weight: 431 KB
Volume: 28
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-010-9155-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Slater orders and Hamiltonian paths of t

Slater orders and Hamiltonian paths of tournaments

✍ Irène Charon; Olivier Hudry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A comparison between the prudent order a

A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules

✍ Claude Lamboray 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Relationships between total domination,

Relationships between total domination, order, size, and maximum degree of graphs

✍ Anders Yeo 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract A total dominating set, __S__, in a graph, __G__, has the property that every vertex in __G__ is adjacent to a vertex in __S__. The total dominating number, γ~__t__~(__G__) of a graph __G__ is the size of a minimum total dominating set in __G__. Let __G__ be a graph with no component of