Results 231 to 240 of about 98,039 (260)
Decision‐Making and Knowledge Around Inductions of Labor: A Survey Study in Ireland
Birth, EarlyView.This study explored women's experiences of decision‐making and knowledge of inductions of labor (IOL) in Ireland. Using a national online survey of 1091 respondents who gave birth between 2018 and 2023, the research reveals substantial gaps in informed consent and autonomy.
Allison Panaro +2 more
wiley +1 more source
Genomic insights into the recent evolution and biodiversity of Italian sheep breeds. [PDF]
Mamm GenomeBionda A +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quaestiones Mathematicae, 2015
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +5 more sources
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +5 more sources
Total Roman domination in digraphs
Quaestiones Mathematicae, 2019Let D be a finite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0, 1, 2} satisfying the condition that every vertex v with f ...
Guoliang Hao, Wei Zhuang, Kangxiu Hu
openaire +1 more source
Journal of Combinatorial Optimization, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi +2 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 ...
Amjadi, J., Pourhosseini, F.
openaire +2 more sources
Nordhaus–Gaddum bounds for total Roman domination
Journal of Combinatorial Optimization, 2017In this paper, the authors discuss Nordhaus-Gaddum bounds for the total Roman domination number. In the introductory part, the authors recollect graph preliminaries, open neighborhood, closed neighborhood, degree, complement of a graph, diameter and corona graph. Also, they give Roman dominating function, total Roman dominating function and total Roman
Amjadi, J. +2 more
openaire +1 more source
Global total Roman domination in graphs
Discrete Mathematics, Algorithms and Applications, 2017A total Roman dominating function (TRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions (i) every vertex [Formula: see text] for which [Formula: see text] is adjacent at least one vertex [Formula: see text] for which [Formula: see text] and (ii) the subgraph of [Formula: see text] induced by the set of all ...
Amjadi, J. +2 more
openaire +1 more source
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs
2021For a simple, undirected and connected graph \(G = (V, E)\), a total Roman dominating function (TRDF) \(f : V \rightarrow \lbrace 0, 1, 2 \rbrace \) has the property that, every vertex u with \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v) = 2\) and the subgraph induced by the set of vertices labeled one or two has no isolated ...
Chakradhar Padamutham +1 more
openaire +1 more source
Quasi total double Roman domination in trees
2023Summary: A quasi total double Roman dominating function (QTDRD-function) on a graph \(G=(V(G)\), \(E(G))\) is a function \(f:V(G)\longrightarrow \{0,1,2,3\}\) 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\) with \(f(w)=3\); (ii) if \(f(v)=1\), then vertex \(v ...
Akhoundi, Maryam +3 more
openaire +1 more source