Results 161 to 170 of about 525 (192)
The Coordination Chemistry of Two Peptidic Models of NFeoB and Core CFeoB Regions of FeoB Protein: Complexes of Fe(II), Mn(II), and Zn(II). [PDF]
Orzel B +6 more
europepmc +1 more source
The Role of the Gut Microbiome in Non-Hodgkin Lymphoma (NHL): A Focus on Diffuse Large B-Cell Lymphoma, Follicular Lymphoma, Cutaneous T-Cell Lymphoma, and NK/T-Cell Lymphoma. [PDF]
Łyko M, Maj J, Jankowska-Konsur A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A New Bound on the Total Domination Subdivision Number
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana Khoeilar +2 more
exaly +2 more sources
Bounding the total domination subdivision number of a graph in terms of its order
Journal of Combinatorial Optimization, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami +1 more
exaly +2 more sources
Results on Total Restrained Domination number and subdivision number for certain graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2015AbstractIn this paper we determine the total restrained domination number and subdivision number for andrasfai graph, chvatal graph, wheel graph, windmill graph and strong product graph.
Bijan Davvaz, P Jeyanthi
exaly +2 more sources
On the total domination subdivision number in some classes of graphs
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana Khoeilar +2 more
exaly +2 more sources
Disjunctive Total Domination Subdivision Number of Graphs
Fundamenta Informaticae, 2020A set S ⊆ V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of
Ciftci, Canan, Aytac, Vecdi
openaire +2 more sources
Game total domination subdivision number of a graph
Discrete Mathematics, Algorithms and Applications, 2015A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγt(G) is the minimum cardinality of a total dominating set of G. The game total domination subdivision number of a graph G is defined by the following game. Two players 𝒟 and 𝒜,
Jafar Amjadi +2 more
openaire +2 more sources

