A Note on Balancedness of Dominating Set Games
β Scribed by Qizhi Fang; Hye Kyung Kim
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 159 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d
Let M be a finite subset of vertices of a connected graph G and assume that every vertex v E M has a dominating radius r(v)E N U {0}. A complete subgraph C is an r-dominating clique of M if every vertex vEM is at distance at most r(v) from C. Even for r(v)~ 1 the problem whether or not a given graph
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.