Results 171 to 180 of about 14,901,088 (199)

Stable flies preferentially oviposit on sites offering conspecific eggs with egg‐derived bacterial semiochemicals

Insect Science, EarlyView.
Stable flies preferentially oviposit on sites offering conspecific eggs with egg‐derived airborne semiochemicals. Egg‐borne bacterial symbionts, and Serratia marcescens in particular, produce odorants which attract gravid female flies and elicit oviposition.
Emmanuel Hung, Anya Gould, Stephanie Zaborniak, Caelen Watson, Regine Gries, Sukhmani Kaur, Kyra Stephens, Augustus Negraeff, Ryan Lam, Alpha Hui, Pantea Zamani, Aryan Monfared, Gerhard Gries   +12 more
wiley   +1 more source

Layered abandonment: The moral interpretation of suffering in extreme confinement

Criminology, EarlyView.
Abstract Loss and rejection are central to prison life, yet how they crystallize into a more general sense of abandonment remains under‐theorized. Drawing on 64 interviews with men held in prolonged self‐isolation or serving indeterminate forvaring sentences in Denmark, we conceptualize abandonment not simply as hardship but as suffering plus ...
Frederik Rom Taxhjelm, Julie Laursen
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total double Roman domination numbers in digraphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [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 ...
Jafar Amjadi, F. Pourhosseini
openaire   +2 more sources

Total Roman {3}-domination in Graphs

Symmetry, 2020
For a graph G = ( V , E ) with vertex set V = V ( G ) and edge set E = E ( G ) , a Roman { 3 } -dominating function (R { 3 } -DF) is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that
Doost Ali Mojdeh, Zehui Shao, Lutz Volkmann   +2 more
exaly   +2 more sources

Further Progress on the Total Roman $$\{2\}$$-Domination Number of Graphs

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, Hossein, Chellali, Mustapha, Hajjari, Maryam, Sheikholeslami, Seyed Mahmoud   +3 more
openaire   +2 more sources

New bounds on the outer-independent total double Roman domination number

Discrete Mathematics, Algorithms and Applications, 2023
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
openaire   +2 more sources

Twin signed total Roman domination numbers in digraphs

Asian-European Journal of Mathematics, 2018
Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text] and arc set [Formula: see text]. A twin signed total Roman dominating function (TSTRDF) on the digraph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) [Formula: see text] and [Formula: see text] for each [Formula: see text ...
Amjadi, J., Soroudi, M.
openaire   +2 more sources

Total Roman domination in the lexicographic product of graphs [PDF]

Discrete Applied Mathematics, 2019
A total Roman dominating function of a graph $G=(V,E)$ is a function $f: V(G)\to \{0,1,2\}$ such that for every vertex $v$ with $f(v)=0$ there exists a vertex $u$ adjacent to $v$ with $f(u)=2$, and such that the subgraph induced by the set of vertices ...
Dorota Kuziak
exaly   +2 more sources

Total Weak Roman Domination in Graphs

Symmetry, 2019
Given a graph G=(V,E) , a function f:V→{0,1,2,⋯} is said to be a total dominating function if ∑u∈N(v)f(u)>0 for every v∈V , where N(v) denotes the open neighbourhood of v. Let Vi={x∈V:f(x)=i} .
Juan Alberto Rodríguez-Velázquez, Abel Cabrera Martinez, Luis Pedro Montejano   +2 more
exaly   +3 more sources

Bounds on the quasi-total double Roman domination number in graphs

Discrete Mathematics, Algorithms and Applications
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 [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned 2 under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; (ii) if [
J. Amjadi, S. Babaei, S. M. Sheikholeslami, M. Chellali, S. Kosari   +4 more
openaire   +1 more source