Results 221 to 230 of about 13,115 (262)
Exploring the properties of antituberculosis drugs through QSPR graph models and domination-based topological descriptors. [PDF]
Sci RepS TP +2 more
europepmc +1 more source
TGN-MCDS: A Temporal Graph Network-Based Algorithm for Cluster-Head Optimization in Large-Scale FANETs. [PDF]
Sensors (Basel)Fan X, Yang Y, Zhang S, Cai W.
europepmc +1 more source
Computation of domination degree-based topological indices using python and QSPR analysis of physicochemical and ADMET properties for heart disease drugs. [PDF]
Front ChemKuriachan G, Parthiban A.
europepmc +1 more source
Authoritarianism in youth social life: systematic literature review (2015-2025). [PDF]
Front PsycholTroncoso-Tejada G +4 more
europepmc +1 more source
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications. [PDF]
Sci RepHayat S +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Total domination and transformation
Information Processing Letters, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter Kratsch, Lorna Stewart
openaire +2 more sources
Quaestiones Mathematicae, 2015
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
Networks, 1980
AbstractA set D of vertices of a finite, undirected graph G = (V, E) is a total dominating set if every vertex of V is adjacent to some vertex of D. In this paper we initiate the study of total dominating sets in graphs and, in particular, obtain results concerning the total domination number of G (the smallest number of vertices in a total dominating ...
Ernest J. Cockayne +2 more
openaire +2 more sources
AbstractA set D of vertices of a finite, undirected graph G = (V, E) is a total dominating set if every vertex of V is adjacent to some vertex of D. In this paper we initiate the study of total dominating sets in graphs and, in particular, obtain results concerning the total domination number of G (the smallest number of vertices in a total dominating ...
Ernest J. Cockayne +2 more
openaire +2 more sources