科研之友
微信
新浪微博
Facebook
分享链接
摘要
The independent domination subdivision number of a simple graph G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the independent domination number. For any tree, the independent domination subdivision number always lies between one and three inclusive. In this paper, we provide a constructive characterization of trees whose independent domination subdivision number is exactly three.
- 出版日期2010-12
