| IS γα≤δ FOR GRAPHS WHICH HAVE DIAMETER TWO? |
| |
| 作者姓名： | CHEN Yaojun |
| |
| 作者单位： | CHEN Yaojun
(Department of Mathematics，Nanjing University，Nanjing 210093，China)
ZHANG Yunqing
(Department of Mathematics，Shaanxi Normal University，Xi 'an 710062，China)
ZHANG Kemin (Department of Mathematics，Nanjing University，Nanjing 210093. China) |
| |
| 基金项目： | This research is supported by the National Natural Science Foundation of China，This project is supported by Nanjing University Talent Development Foundation. |
| |
| 摘 要： | A subset of S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it. is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by 7a(G), is called the acyclic domination number of G. S. M. Hedetniemi et al. on 2000 introduced the concept of acyclic domination and posed the following open problem: Is -ya(G) < <5(G) for any graph whose diameter is two? In this paper, we give a counterexample which disproves the problem.
|
| 本文献已被 CNKI 等数据库收录！ |
