Results 161 to 170 of about 302 (207)
Terendak Military Cemetery: Bodies, Burials, and ‘Operation Bring Them Home'
Terendak Military Cemetery occupies an unusual position in the history of Australian war cemeteries. Initially established to service the needs of the community at Terendak Garrison—the operational base for Commonwealth forces in Malaya during the early years of the Cold War—it became the official overseas burial site of Australian dead during the ...
Hannah Swaine, Kate Ariotti
wiley +1 more source
The nation‐state, non‐Western empires, and the politics of cultural difference
Abstract While empires have been central to political theory, they almost always refer to Western forms of imperialism and colonialism to which non‐Western societies are subject. But precolonial empires have ruled much of the world for much of known history. Building on recent International Relations (IR) scholarship, this article reconstructs an ideal
Loubna El Amine
wiley +1 more source
On the strong Roman domination number of graphs
23 ...
S M Sheikholeslami, Ismael G Yero
exaly +5 more sources
On the Roman domination number of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O Favaron, H Karami, R Khoeilar
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Double Roman domination number
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., S. Aparna Lakshmanan
openaire +2 more sources
On the Roman domination subdivision number of a graph
Journal of Combinatorial Optimization, 2020Let \(G\) be a graph and let \(V_0\), \(V_1\), \(V_2\) be a partition of \(V(G)\). Such a partition is a Roman partition if every vertex from \(V_0\) has a neighbor in \(V_2\). The Roman domination number is \(\gamma_R(G)=\min\{2|V_2|+|V_1|\}\), where the minimum is taken over all Roman partitions of \(G\).
Jafar Amjadi +3 more
openaire +1 more source
Relations between the Roman k-domination and Roman domination numbers in graphs
Discrete Mathematics, Algorithms and Applications, 2014Let G = (V, E) be a graph and let k be a positive integer. A Roman k-dominating function ( R k-DF) on G is a function f : V(G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least k vertices v1, v2, …, vk with f(vi) = 2 for i = 1, 2, …, k.
Ahmed Bouchou +2 more
openaire +2 more sources
Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
RAIRO - Operations Research, 2019A Roman {2}-dominating function (R{2}DF) on a graph G =(V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f(v) = 2 or two vertices v1, v2 with f(v1) = f(v2) = 1. The weight of an R{2}DF f is the value w(f) = ∑u∈Vf(u).
Pu Wu +3 more
openaire +1 more source
On trees with domination number equal to edge-vertex roman domination number
Discrete Mathematics, Algorithms and Applications, 2020An edge-vertex Roman dominating function (or just ev-RDF) of a graph [Formula: see text] is a function [Formula: see text] such that for each vertex [Formula: see text] either [Formula: see text] where [Formula: see text] is incident with [Formula: see text] or there exists an edge [Formula: see text] adjacent to [Formula: see text] such that [Formula:
H. Naresh Kumar +1 more
openaire +2 more sources
Total double Roman domination numbers in digraphs
Discrete Mathematics, Algorithms and Applications, 2021Let [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

