Results 221 to 230 of about 839 (260)

Private Land Ownership: Tax or Socialize?

The American Journal of Economics and Sociology, EarlyView.
ABSTRACT This study compares the land reform concepts of Henry George and Silvio Gesell, both of whom rejected private appropriation of land rent as unjust. While George proposed to “hollow out” private land ownership through a comprehensive land value tax, Gesell aimed at full socialization of land combined with lease auctions and compensation of ...
Dirk Loehr
wiley   +1 more source

The epistemological implications of species extinction: An overview. [PDF]

Ambio
Luetz JM.
europepmc   +1 more source

Letters of recognition: the spatial inscription of literature in the Romanian street nomenclature. [PDF]

Humanit Soc Sci Commun
Rusu MS, Baghiu S.
europepmc   +1 more source

Queer compromises: How homophobic violence pushed gays and lesbians to make police alliances in Toronto, 1981-2001. [PDF]

Sexualities
Holmes A.
europepmc   +1 more source

Total Roman {3}-domination in Graphs [PDF]

Symmetry, 2020
For a graph G = ( V , E ) with vertex set V = V ( G ) and edge set E = E ( G ) , a Roman { 3 } -dominating function (R { 3 } -DF) is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that ∑ u ∈ N G ( v ) f ( u ) ≥ 3 , if f ( v ) = 0 , and ∑ u ∈ N G ( v ) f ( u
Doost Ali Mojdeh, Zehui Shao, Lutz Volkmann   +2 more
exaly   +5 more sources

Bounds on weak roman and 2-rainbow domination numbers [PDF]

Discrete Applied Mathematics, 2014
We mainly study two related dominating functions, namely, the weak Roman and 2-rainbow dominating functions. We show that for all graphs, the weak Roman domination number is bounded above by the 2-rainbow domination number.
TERESA Haynes, Stephen T Hedetniemi
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs

2021
For a simple, undirected and connected graph \(G = (V, E)\), a total Roman dominating function (TRDF) \(f : V \rightarrow \lbrace 0, 1, 2 \rbrace \) has the property that, every vertex u with \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v) = 2\) and the subgraph induced by the set of vertices labeled one or two has no isolated ...
Chakradhar Padamutham, Venkata Subba Reddy Palagiri   +1 more
openaire   +1 more source

Total double Roman domination numbers in digraphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [Formula: see text] be a finite and simple digraph with vertex set [Formula: see text]. A double Roman dominating function (DRDF) on digraph [Formula: see text] is a function [Formula: see text] such that every vertex with label 0 has an in-neighbor with label 3 or two in-neighbors with label 2 and every vertex with label 1 have at least one in ...
Jafar Amjadi, F. Pourhosseini
openaire   +2 more sources

Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination

Journal of Combinatorial Optimization, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali   +2 more
openaire   +2 more sources

On Total Roman Domination in Graphs

2017
A Roman dominating function (RDF) on a graph \(G = (V,E)\) is a function \( f:V \rightarrow \lbrace 0,1,2\rbrace \) satisfying the condition that every vertex u for which \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v)=2\). A total Roman dominating function on a graph \(G = (V,E)\) is a Roman dominating function \(f : V \rightarrow ...
P. Roushini Leely Pushpam, Padmapriea Sampath   +1 more
openaire   +1 more source