A Cross-Entropy Approach to the Domination Problem and Its Variants. [PDF]
Burdett R, Haythorpe M, Newcombe A.
europepmc +1 more source
The postcolonial sociology of love in Gandhi's non-violent political culture of <i>Satyagraha</i>. [PDF]
Gianolla C.
europepmc +1 more source
Exploring the properties of antituberculosis drugs through QSPR graph models and domination-based topological descriptors. [PDF]
S TP +2 more
europepmc +1 more source
Culture of paternalism in the emergency department: a critical ethnographic study. [PDF]
Davoudi N +4 more
europepmc +1 more source
Participatory approaches to climate adaptation, resilience, and mitigation: A systematic review. [PDF]
Parsons M +7 more
europepmc +1 more source
Development of a quantitative self-assessment tool for hospital antimicrobial stewardship and infection control programs: a step towards standardizing clinical studies. [PDF]
Zanichelli V +15 more
europepmc +1 more source
Double Roman domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., Aparna Lakshmanan S.
openaire +3 more sources
Related searches:
On Sombor index of trees with fixed domination number
Applied Mathematics and Computation, 2022Summary: The Sombor index is a novel topological molecular descriptor introduced by I. Gutman [“Some basic properties of Sombor indices”, Open J. Discrete Appl. Math. 4, 1, 1–3 (2021; psrp-odam2021.0047 )].
Xiaoling Sun, Jianwei Du
semanticscholar +1 more source
Extremal trees for the Randić index with given domination number
Applied Mathematics and Computation, 2020The Randic index is the topological index most widely used in applications for chemistry and pharmacology. It is defined for a graph G with vertex set V(G) and edge set E(G) as R ( G ) = ∑ u v ∈ E ( G ) 1 deg ( u ) deg ( v ) , where deg ( u ) and deg ( v
S. Bermudo, J. E. Valdés, J. Rada
semanticscholar +1 more source
Distance r-domination number and r-independence complexes of graphs
European journal of combinatorics (Print), 2020For $r\geq 1$, the $r$-independence complex of a graph $G$, denoted Ind$_r(G)$, is a simplicial complex whose faces are subsets $A \subseteq V(G)$ such that each component of the induced subgraph $G[A]$ has at most $r$ vertices.
Priyavrat Deshpande +2 more
semanticscholar +1 more source

