Results 31 to 40 of about 86,729 (238)
Total Roman Reinforcement in Graphs
Discussiones Mathematicae Graph Theory, 2019 A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Protecting a Graph with Mobile Guards [PDF]
, 2015 Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed.
Klostermeyer, William F. +1 more
core +1 more source
Total Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +1 more source
Signed Total Roman Edge Domination In Graphs
Discussiones Mathematicae Graph Theory, 2017 Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open ...
Asgharsharghi Leila +1 more
doaj +1 more source
Diversity, 2023 Halmyris (Murighiol, Tulcea County, Romania) is one of the most important Roman settlements located in the inferior sector of the Danube Delta, in the easternmost part of Scythia province during the Late Antiquity.
Margareta Simina Stanc +4 more
doaj +1 more source
Total Roman domination for proper interval graphs
Electronic Journal of Graph Theory and Applications, 2020 A function f:V → {0,1,2} is a total Roman dominating function (TRDF) on a graph G=(V,E) if for every vertex v ∈ V with f(v) = 0 there is a vertex u adjacent to v with f(u) = 2 and for every vertex v ∈ V with f(v) > 0 there exists a vertex u ∈ NG(v ...
Abolfazl Poureidi
doaj +1 more source
Total Roman 2-Reinforcement of Graphs
Journal of Mathematics, 2021 A total Roman 2-dominating function (TR2DF) on a graph Γ=V,E is a function l:V⟶0,1,2, satisfying the conditions that (i) for every vertex y∈V with ly=0, either y is adjacent to a vertex labeled 2 under l, or y is adjacent to at least two vertices labeled
M. Kheibari +3 more
doaj +1 more source
Zmiany struktury użytkowania ziemi w gospodarstwach rolnych województwa kujawsko-pomorskiego w świetle wyników spisów powszechnych rolnictwa z lat 2002 i 2010 [PDF]
, 2014 The study presents the results of the spatial analysis of the total area of agricultural holdings as of 2010 and the changes in these figures as recorded in 2002 and 2010, whereby the agricultural acreage (including: arable lands, permanent crops and ...
Dubownik, Anna, Rudnicki, Roman
core +2 more sources
On The Total Roman Domination in Trees
Discussiones Mathematicae Graph Theory, 2019 A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by ...
Amjadi Jafar +2 more
doaj +1 more source
Quasi total double Roman domination in graphs
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +1 more source