Results 251 to 260 of about 368,632 (278)

Domination and Total Domination in Hypergraphs

2020
A dominating set in a hypergraph H with vertex set V (H) and E(H) is a subset of vertices D ⊆ V (H) such that for every vertex v ∈ V (H) ∖ D, there exists an edge e ∈ E(H) for which v ∈ e and e ∩ D≠∅. A total dominating set in H is a dominating set D of H with the additional property that for every vertex v in D, there exists an edge e ∈ E(H) for which
Henning, Michael A., Yeo, Anders
openaire   +2 more sources

Upper Total Domination

2013
In this chapter we focus on the upper total domination number of a graph. Recall that the upper domination number of a graph G, denoted by Γ(G), is the maximum cardinality of a minimal dominating set in G, while the upper total domination number of G, denoted by Γ t (G), is the maximum cardinality of a minimal TD-set in G.
Michael A. Henning, Anders Yeo
openaire   +1 more source

Total forcing versus total domination in cubic graphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randy Davila, Michael A. Henning
openaire   +2 more sources

SUPERLATIVE TOTAL DOMINATION IN GRAPHS

Electronic Journal of Mathematical Analysis and Applications
Summary: Let \(G= (V, E)\) be a simple graph with no isolated vertices and \(p \geq 3\). A set \(D \subseteq V\) is a dominating set, abbreviated as DS, of a graph \(G\), if every vertex in \(V-D\) is adjacent to some vertex in \(D\), while a total dominating set, abbreviated as TDS, of \(G\) is a set \(T \subseteq V\) such that every vertex in \(G ...
Bankapur, Veena, Chaluvaraju, B.
openaire   +1 more source

Total Dominator Total Chromatic Numbers of Some Graphs

Utilitas Mathematica
Total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph.
Vusuqi, Leila, Kazemi, Adel P., Kazemnejad, Farshad   +2 more
openaire   +2 more sources

Total domination edge critical graphs

1998
A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if for each \(x\in V(G)\) there exists a vertex \(y\in D\) adjacent to \(x\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
Van Der Merwe, L. C., Mynhardt, C. M., Haynes, T. W.   +2 more
openaire   +1 more source

Cancer statistics for the US Hispanic/Latino population, 2021

Ca-A Cancer Journal for Clinicians, 2021
Kimberly D Miller, Paulo S Pinheiro, Priti Bandi   +2 more
exaly  

Global cancer statistics

Ca-A Cancer Journal for Clinicians, 2011
Frank Bray
exaly  

Using a population-based cancer reporting system to evaluate a breast cancer detection and awareness program

Ca-A Cancer Journal for Clinicians, 1992
Patrick L Remington
exaly  

Cancer Statistics for Hispanics/Latinos, 2018

Ca-A Cancer Journal for Clinicians, 2018
Kimberly D Miller, Paulo S Pinheiro, Ahmedin Jemal Dvm   +2 more
exaly