科研之友
微信
新浪微博
Facebook
分享链接
摘要
A 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 induced by Va-S is connected. The total outer-connected domination number gamma (toc) (G) is the minimum size of such a set. We give some properties and bounds for gamma (toc) in general graphs and in trees. For graphs of order n, diameter 2 and minimum degree at least 3, we show that and we determine the extremal graphs.
- 出版日期2014-4
