✦ LIBER ✦

Rawls on Liberty and Domination

✍ Scribed by M. Victoria Costa

Publisher: Springer Netherlands
Year: 2009
Tongue: English
Weight: 173 KB
Volume: 15
Category: Article
ISSN: 1356-4765
DOI: 10.1007/s11158-009-9102-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Rawls on Mill On Liberty and so on

✍ Marcus G. Singer 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 523 KB

As I was reading and rereading diligently along in John Rawls' Theory of Justice (Harvard University Press, 1971), hoping to figure out whodunit, I was startled by the following three sentences in a footnote on p. 209: "Mill's definition of utility as grounded on the permanent interests of a man as

Rawls on average and total utility

✍ Gregory S. Kavka 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 1008 KB

On graphs with equal domination and inde

On graphs with equal domination and independent domination numbers

✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Note on 2-rainbow domination and Roman d

Note on 2-rainbow domination and Roman domination in graphs

✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that

Rawls on average and total utility: A co

Rawls on average and total utility: A comment

✍ Brian Barry 📂 Article 📅 1977 🏛 Springer Netherlands 🌐 English ⚖ 541 KB