Results 211 to 220 of about 25,954 (258)
Strict patterns of co‐divergence have rarely been documented other than among organisms and their symbionts. In this paper, using a molecular approach, we inferr the population‐level phylogenies of a Mediterranean ant species Pheidole pallidula and its nest parasite, the obligate myrmecophilous beetle Paussus favieri. We then investigate the role of co‐
Davide Bergamaschi +2 more
wiley +1 more source
The Dogs of Tsenacomoco: Ancient DNA Reveals the Presence of Local Dogs at Jamestown Colony in the Early Seventeenth Century. [PDF]
Thomas AE +8 more
europepmc +1 more source
Weaker the gang, harder the exit
Abstract This study draws on 95 interviews and observations with gang‐affiliated individuals in Chicago to examine how gang structures shape disengagement and desistance from crime. During the last two decades, the city's gangs have experienced a decline in group closure, or their capacity to regulate membership and member behavior, and a blurring of ...
Megan Kang
wiley +1 more source
The river Dniester valley: a long record of late-Cenozoic fluvial evolution within the Eastern Carpathian foreland and East European Platform margin. [PDF]
Matoshko AV, Gibbard P.
europepmc +1 more source
Improvement in the English Translations of Albrecht von Haller's Usong (1771)
Abstract The political novel Usong (1771), written by the Swiss physiologist Albrecht von Haller (1708–1777), is set in the fifteenth century and tells the story of a Mongolian prince who becomes the Emperor of Persia and redesigns the government of his empire to promote the happiness of his subjects.
Laura Tarkka
wiley +1 more source
Snake words in Estonia: Language, nature and extinction in Andrus Kivirähk's <i>The Man Who Spoke Snakish</i>. [PDF]
Howard A, Nelson D.
europepmc +1 more source
Global total Roman domination in graphs
A 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 ...
J. Amjadi +2 more
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Total Roman Domination in Graphs
International Conference on Theoretical Computer Science and Discrete Mathematics, 2016A Roman dominating function (RDF) on a graph \(G = (V,E)\) is a function \( f:V \rightarrow \lbrace 0,1,2\rbrace \) satisfying the condition that every vertex u for which \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v)=2\). A total Roman dominating function on a graph \(G = (V,E)\) is a Roman dominating function \(f : V \rightarrow ...
P. R. L. Pushpam, Padmapriea Sampath
semanticscholar +3 more sources
Nordhaus–Gaddum bounds for total Roman domination [PDF]
A Nordhaus–Gaddum-type result is a lower or an upper bound on the sum or the product of a parameter of a graph and its complement. In this paper we continue the study of Nordhaus–Gaddum bounds for the total Roman domination number $$\gamma _{tR}$$
J. Amjadi, S. Sheikholeslami, M. Soroudi
semanticscholar +3 more sources

