Inequalities involving independence domination,f-domination, connected and totalf-domination numbers
β Scribed by Sanming Zhou
- Book ID
- 110420445
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 477 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0011-4642
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d
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