Women and nature: Ecofeminist study in social media. [PDF]
Chakraborty J, Goswami A.
europepmc +1 more source
Communication-Efficient Federated Class-Incremental Intrusion Detection for Edge IoT Networks. [PDF]
Wu Z, He B, Si Z, Qiu C, Liao X, Su C.
europepmc +1 more source
Seasonal variability of meroplankton in the Gulf of Gdańsk, Southern Baltic Sea. [PDF]
Makatun A, Weydmann-Zwolicka A.
europepmc +1 more source
New Osmocene and Ruthenocene Phases Reveal the Common Conformational Behavior Regulated by Anagostic Bonds in Prototypical Metallocenes. [PDF]
Moszczyńska I +2 more
europepmc +1 more source
The Double Dominion Over Women's Bodies as a barrier to exercising sexual and reproductive rights: a mixed-methods study in La Ladrillera, Mexico. [PDF]
Bejarano Zambrano CL +6 more
europepmc +1 more source
On graphs for which the connected domination number is at most the total domination number [PDF]
In this note, we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is
Oliver Schaudt
exaly +2 more sources
On graphs with equal total domination and connected domination numbers [PDF]
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt(G) of G is the minimum cardinality taken over all total dominating sets of G.
Xuegang Chen
exaly +2 more sources
Characterization of graphs with equal domination and connected domination numbers [PDF]
Arumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers.
Xuegang Chen
exaly +2 more sources
Bounds on the connected domination number of a graph
A subset S of vertices in a graph G=(V,E) is a connected dominating set of G if every vertex of V\-S is adjacent to a vertex in S and the subgraph induced by S is connected.
Michael Henning +2 more
exaly +2 more sources
Total outer-connected domination numbers of trees [PDF]
Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if D is dominating, and the induced subgraph G[D] does not contain an isolated vertex.
Joanna Cyman, Joanna Raczek
exaly +2 more sources

