Results 71 to 80 of about 421 (93)
On the total domination subdivision number in some classes of graphs
Journal of Combinatorial Optimization, 2008 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\(\mathrm {sd}_{\gamma_{t}}(G)\) is the minimum number of edges that must be ...
Odile Favaron +3 more
openalex +3 more sources
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
Journal of Combinatorial Optimization, 2011 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 $\mathrm{sd}_{\gamma_{t}}(G)$ is the minimum number of edges that must be
Hossein Karami +2 more
openalex +3 more sources
Bounding the total domination subdivision number of a graph in terms of its order
Journal of Combinatorial Optimization, 2009 The total domination subdivision number $\mathrm{sd}_{\gamma _{t}}(G)$ of a graph G is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. In this paper we prove that $\mathrm{sd}_{\gamma_{t}}(G)\leq \lfloor\frac{2n}{3}\rfloor$ for any simple connected ...
Odile Favaron +2 more
openalex +3 more sources
Results on Total Restrained Domination number and subdivision number for certain graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2015 AbstractIn 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.
P. Jeyanthi, G. Hemalatha, B. Davvaz
openalex +3 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.
Rana Khoeilar +2 more
openaire +2 more sources
Total domination subdivision numbers
The authors introduce and study the total domination subdivision number \(sd_{\gamma_t}(G)\) of a graph \(G\) as the minimum number of edges that must be subdivided (where each edge of \(G\) can be subdivided at most once) in order to increase the total domination number.Haynes, Teresa W. +2 more
openaire +1 more source