Results 221 to 230 of about 838 (256)

Private Land Ownership: Tax or Socialize?

open access: yesThe 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

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 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   +1 more
openaire   +1 more source

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   +2 more
openaire   +2 more sources

Nordhaus–Gaddum bounds for total Roman domination

Journal of Combinatorial Optimization, 2017
In this paper, the authors discuss Nordhaus-Gaddum bounds for the total Roman domination number. In the introductory part, the authors recollect graph preliminaries, open neighborhood, closed neighborhood, degree, complement of a graph, diameter and corona graph. Also, they give Roman dominating function, total Roman dominating function and total Roman
Jafar Amjadi   +2 more
openaire   +1 more source

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   +1 more
openaire   +1 more source

Total Roman domination in digraphs

Quaestiones Mathematicae, 2019
Let D be a finite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0, 1, 2} satisfying the condition that every vertex v with f ...
Guoliang Hao, Wei Zhuang, Kangxiu Hu
openaire   +1 more source

Algorithmic aspects of total Roman {3}-domination in graphs

Discrete Mathematics, Algorithms and Applications, 2020
For a simple, undirected, connected graph [Formula: see text], a function [Formula: see text] which satisfies the following conditions is called a total Roman {3}-dominating function (TR3DF) of [Formula: see text] with weight [Formula: see text]: (C1) For every vertex [Formula: see text] if [Formula: see text], then [Formula: see text] has [Formula ...
Chakradhar Padamutham   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy