Results 61 to 70 of about 421 (93)

Large-scale comparative analysis reveals top graph signal processing features for subject identification

Bolton TAW, Schöttner M, Patel J, Fluhr H, Alemán-Gómez Y, Hagmann P.   +5 more
europepmc   +1 more source

Numerical Study towards In Vivo Tracking of Micro-/Nanoplastic Based on X-ray Fluorescence Imaging. [PDF]

Biomedicines
von der Osten-Sacken C, Staufer T, Rothkamm K, Kuhrwahl R, Grüner F.   +4 more
europepmc   +1 more source

Leveraging the subgenus category to address genus over-splitting exemplified with Prescottella and other recently proposed Mycobacteriales genera

Val-Calvo J, Scortti M, Vázquez-Boland JA.   +2 more
europepmc   +1 more source

Total domination and total domination subdivision number of a graph and its complement

Discrete Mathematics, 2007
AbstractA set S of vertices of a graph G=(V,E) with no 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 total domination subdivision number sdγt(G) is the minimum number of edges that must be subdivided in ...
Odile Favaron, Hamed Karami, Seyed Mahmoud Sheikholeslami   +2 more
openalex   +3 more sources

Game total domination subdivision number of a graph

Discrete Mathematics, Algorithms and Applications, 2015
A 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, Hossein Karami, Seyed Mahmoud Sheikholeslami   +2 more
openalex   +3 more sources

Total Domination Subdivision Number in Strong Product Graph [PDF]

American Journal of Applied Mathematics and Statistics, 2014
A set D of vertices in a graph G(V,E) is called a total dominating set if every vertex v∈V is adjacent to an element of D. The domination subdivision number of a graph G is the minimum number of edges that must be subdivided in order to increase the domination number of a graph. In this paper, we determine the total domination number for strong product
P. Jeyanthi, G. Hemalatha, B. Davvaz
openalex   +3 more sources

WITHDRAWN: Matchings and total domination subdivision number in graphs

Applied Mathematics Letters, 2012
Odile Favaron, Hamed Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openalex   +3 more sources

An Upper Bound for the Total Domination Subdivision Number of a Graph [PDF]

Graphs and Combinatorics, 2009
A 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 total domination subdivision number $${{\rm sd}_{\gamma_t}(G)}$$ is the minimum number of edges that must ...
Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar   +3 more
openalex   +2 more sources

Matchings and total domination subdivision number in graphs with few induced 4-cycles

Discussiones Mathematicae Graph Theory, 2010
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openalex   +3 more sources