Results 1 to 10 of about 41,611 (185)
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +4 more sources
Bounds on signed total double Roman domination [PDF]
Communications in Combinatorics and Optimization, 2020 A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi +3 more
doaj +2 more sources
Signed double Roman domination in graphs
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Abdollahzadeh Ahangar +2 more
openaire +5 more sources
More results on the signed double Roman domination number of graphs
AKCE International Journal of Graphs and CombinatoricsA signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +3 more sources
Signed double Roman domination on cubic graphs
Applied Mathematics and Computation, 2023 The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given whenever (i) vertices labeled $\pm{}1$ have at least one neighbor with label in $\{2,3\}$; (ii) each ...
Enrico Iurlano +3 more
openaire +4 more sources
More results on the signed double Roman k-domination in graphs
Aequationes mathematicaeAbstract Let $$k\ge 1$$ k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V(G).
Henning, Michael A., Volkmann, Lutz
openaire +4 more sources
A Late Medieval Knight Reflecting on his Public Life: Hugo de Urriés (c. 1405-c. 1493), Diplomacy and Translating the Classics [PDF]
, 2012 This article focuses on Aragonese courtier Hugo de Urriés's public profile by means of analyzing the critical points derived from examining his personal, political, cultural and historical stands making use of an invaluable primary source, his letter to ...
Conde Solares, Carlos
core +1 more source
Delenda est haec Carthago: the Ostend company as a problem of European great power politics (1722-1727) [PDF]
, 2015 The Ostend Company (1722-1731) is a symbol of present-day Belgium’s strangling by European Great Power politics in the Ancien Régime, and more specifically of the limitations imposed on the Southern Netherlands by the Dutch Republic in 1648.
Dhondt, Frederik
core +3 more sources
Imperatives without imperator [PDF]
, 2009 Schmitt’s theologisation of sovereignty has been subjected, 50 years later, to a ‘quarter turn’ by Foucault’s move from issues of domination to issues of government.
Anton Schütz +5 more
core +1 more source
Translated identities: 'Pakeha' as subjects of the Treaty of Waitangi [PDF]
, 2005 The politics of translation is clearly a perennial focus of debate in New Zealand, as shown by thematic links between the New Zealand social anthropology conferences at Waikato in 1990 and Auckland in 2004.
Goldsmith, Michael
core +2 more sources