Results 11 to 20 of about 48,400 (246)
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 +3 more sources
Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs [PDF]
Mediterranean Journal of Mathematics, 2022 For a given graph G without isolated vertex we consider a function f:V(G)→{0,1,2}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage ...
A. Cabrera Martínez +2 more
semanticscholar +2 more sources
The signed (total) Roman domination problem on some classes of planar graphs - Convex polytopes [PDF]
Discret. Math. Algorithms Appl., 2021 In this paper we deal with the calculation of the signed (total) Roman domination numbers, $\gamma_{sR}$ and $\gamma_{stR}$ respectively, on a few classes of planar graphs from the literature.
Tatjana Zec +2 more
semanticscholar +1 more source
Signed Total Strong Roman Domination in Graphs
Discrete Mathematics Letters, 2022 Let G = ( V, E ) be a finite and simple graph of order n and maximum degree ∆ . A signed total strong Roman dominating function on G is a function f : V → {− 1 , 1 , 2 , . . .
M. Hajjari, S. Sheikholeslami
semanticscholar +1 more source
The harmonization of business law in Africa: is article 42 of the OHADA Treaty a problem? [PDF]
, 2007 The primary function of the Organization for the Harmonization of Business Law in Africa (OHADA) is to modernize and harmonize the business laws of member states.
Enonchong, Nelson
core +1 more source
On the Quasi-Total Roman Domination Number of Graphs
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
semanticscholar +1 more source
Closed formulas for the total Roman domination number of lexicographic product graphs
Ars Math. Contemp., 2021 Let G be a graph with no isolated vertex and f : V ( G ) → {0, 1, 2} a function. Let V i = { x ∈ V ( G ) : f ( x ) = i } for every i ∈ {0, 1, 2} . We say that f is a total Roman dominating function on G if every vertex in V 0 is adjacent to at least
Abel Cabrera Martínez +1 more
semanticscholar +1 more source
Nationalism, Myth and Reinterpretation of History: The Neglected Case of Interwar Yugoslavia [PDF]
, 2012 This article discusses and challenges some popular myths and perceptions about interwar Yugoslavia in post-socialist (and post-Yugoslav) Serbia. These include discourses that blame ‘others’ – ‘treacherous’ Croats and other non-Serbs, the ‘perfidious ...
Djokic, Dejan
core +1 more source
Complexity of signed total $k$-Roman domination problem in graphs
, 2020 Let $G$ be a simple graph with finite vertex set $V(G)$ and $S=\{-1,1,2\}$. A signed total Roman $k$-dominating function (STRkDF) on a graph $G$ is a function $f:V(G)\to S$ such that (i) any vertex $y$ with $f(y)=-1$ is adjacent to at least one vertex $t$
S. Kosari +4 more
semanticscholar +1 more source
The Signed Total Roman k-Domatic Number Of A Graph
Discussiones Mathematicae Graph Theory, 2017 Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +1 more source