Results 281 to 290 of about 368,338 (322)
Hamiltonicity of Total Domination 3-Connected Edge Critical Graph.
, 2017 Roland Forson
openalex +1 more source
Molecular Characteristics of Epidemiologically Successful <i>Salmonella</i> Enteritidis in Poland. [PDF]
Transbound Emerg DisKamińska E +6 more
europepmc +1 more source
Identifying factors influencing attitudes toward domestic violence in Iraq. [PDF]
J Educ Health PromotHadi B.
europepmc +1 more source
Total Dominating Sets and Total Domination Polynomials of Square Of Wheels
IOSR Journal of Mathematics, 2014 openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
RAIRO - Theoretical Informatics and Applications, 2020
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G, if every vertex of a graph G is ev-dominated by at least one edge of D.
Sahin, Abdulgani, Sahin, Bunyamin
openaire +4 more sources
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G, if every vertex of a graph G is ev-dominated by at least one edge of D.
Sahin, Abdulgani, Sahin, Bunyamin
openaire +4 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