Results 31 to 40 of about 14,901,088 (199)

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

open access: yes, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar   +3 more
core   +1 more source

On the Roman Edge Domination Number of a Graph [PDF]

open access: yes, 2010
Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi   +5 more
core   +1 more source

Total Roman Reinforcement in Graphs

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

Total Protection of Lexicographic Product Graphs

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

Palaeoeconomy and Palaeoenvironment of Halmyris—A Roman Settlement in Southeast Romania: Archaeozoological and Phytolith Evidences

open access: yesDiversity, 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 Perfect Roman Domination

open access: yes, 2023
A total perfect Roman dominating function (TPRDF) on a graph G=(V,E) is a function f from V to {0,1,2} satisfying (i) every vertex v with f(v)=0 is a neighbor of exactly one vertex u with f(u)=2; in addition, (ii) the subgraph of G that is induced by the
Ahlam Almulhim
core   +1 more source

Total Roman 2-Reinforcement of Graphs

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

Quasi total double Roman domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
A 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

Hydraulicity in Organic Polymers Enabled by Hydrophobization Upon Water‐Triggered Curing of Hydrophilic Chains

open access: yesAngewandte Chemie, EarlyView.
Cement‐mimetic hydraulicity is realized in an organic polymer through a counterintuitive reaction in which a hydrophilic linear polymer reacts with water to undergo hydrophobization during curing via silatrane sol–gel chemistry. This polarity‐inverting curing process turns a water‐plasticized putty into a water‐tolerant rigid material, enabling ...
Rei Tokumitsu   +3 more
wiley   +2 more sources

On the signed total Roman domination and domatic numbers of graphs

open access: yesDiscrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy