On the ratio of the domination number and the independent domination number in graphs
โ Scribed by Furuya, Michitaka; Ozeki, Kenta; Sasaki, Akinari
- Book ID
- 127293679
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 306 KB
- Volume
- 178
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let ฮณ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and Bollobรกs and Cock- ayne [J. Graph Theory (1979) 241-249] proved independently that ฮณ(G) < 2ir(G) for
For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere