Results 191 to 200 of about 19,120 (213)
On two conjectures concerning total domination subdivision number in graphs
Journal of Combinatorial Optimization, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana Khoeilar +2 more
openaire +2 more sources
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
Journal of Combinatorial Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karami, H. +2 more
openaire +3 more sources
On the total domination subdivision number in some classes of graphs
Journal of Combinatorial Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favaron, O. +3 more
openaire +2 more sources
Bounding the total domination subdivision number of a graph in terms of its order
Journal of Combinatorial Optimization, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favaron, Odile +2 more
openaire +2 more sources
WITHDRAWN: Matchings and total domination subdivision number in graphs
Applied Mathematics Letters, 2012 O. Favaron +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
Discrete Mathematics, Algorithms and Applications, 2013A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Favaron, O. +2 more
openaire +2 more sources