Results 61 to 70 of about 9,316,109 (203)
Double Roman domination and domatic numbers of graphs [PDF]
, 2018 A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in \cite{bhh} as a function $f:V(G)\rightarrow\{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned 2 ...
L. Volkmann
core +1 more source
Integrative Zoology, EarlyView.A quantum‐enhanced weighted gene co‐expression network analysis framework integrating quantum amplitude amplification is developed to overcome sample size constraints in zoological genomics. This noise‐tolerant analytical strategy enables robust network reconstruction for non‐model species with limited biological replicates.
Seok‐Jin Kang, Hongchul Shin
wiley +1 more source
Caste criminalisation in South India and permanent migration to Fiji, 1903–1927
Asia‐Pacific Economic History Review, EarlyView.Abstract Does the official criminalisation of a group lead to permanent out‐migration? In the early 20th century, British officials in south India designated multiple castes as inherently criminal under the Criminal Tribes Act (CTA). The CTA required police registration and could force entire groups into special settlements.
Alexander Persaud
wiley +1 more source
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core
Signed strong Roman domination in graphs
, 2017 Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximum degree $\Delta$. A signed strong Roman dominating function (abbreviated SStRDF) on a graph $G$ is a function $f:V\to \{-1,1,2,\ldots,\lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the ...
Seyed Mahmoud Sheikholeslami +2 more
core +1 more source
On signed edge domination numbers of trees [PDF]
, 2002 summary:The signed edge domination number of a graph is an edge variant of the signed domination number. The closed neighbourhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set consisting of $e$ and of all edges having a common end vertex with $e ...
Zelinka, Bohdan
core +1 more source
Rulers on the road: Itinerant rule in the Holy Roman Empire, AD 919–1519
American Journal of Political Science, EarlyView.Abstract Itinerant rule, rule exercised through traveling, was a common yet insufficiently researched, premodern form of governance. Studying the determinants of ruler itineraries in the Holy Roman Empire, AD 919–1519, we argue that rulers' visits targeted “marginal” elites.
Carl Müller‐Crepon +3 more
wiley +1 more source
Total Roman Domination of Kneser Graphs
, 2023 The total Roman domination number of a graph is the smallest possible sum of the weights 0, 1, and 2 applied to vertices of the graph that satisfy certain rules originating from Roman military strategy.
Stainsby, Cole +6 more
core
Mortars From Punic and Hellenistic–Roman Solunto: Materials, Formulations, and Technology
Archaeometry, EarlyView.ABSTRACT This study presents an archaeometric investigation of 18 hydraulic rendering and bedding mortars from Punic and Hellenistic–Roman Solunto (NW Sicily). The research aimed to characterize raw materials, reconstruct manufacturing sequences, and evaluate technological proficiency through mineralogical and petrochemical analyses.
G. Montana +4 more
wiley +1 more source
Archaeometry, EarlyView.ABSTRACT Geochemical analysis of five brooch types from the Lower Rhine area dated to the last century bc and first century ad is used to constrain resource use, exchange and mobility. Lead isotope ratios demonstrate an Iberian provenance for copper in bronze Late Iron Age brooches.
A. A. T. Ruiter +4 more
wiley +1 more source