A note on the independent domination number versus the domination number in bipartite graphs

Title:

A note on the independent domination number versus the domination number in bipartite graphs

Creator:

Wang, Shaohui and Wei, Bing

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:702b64e6-e0a7-43a8-b2fc-642ad3e1945e
uuid:702b64e6-e0a7-43a8-b2fc-642ad3e1945e
issn:0011-4642

Subject:

matematika, mathematics, domination, independent domination, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

Let (G) and i(G) be the domination number and the independent domination number of G, respectively. Rad and Volkmann posted a conjecture that i(G)/ (G) 6 (G)/2 for any graph G, where (G) is its maximum degree (see N. J.Rad, L.Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than (G)/2 are provided as well., Shaohui Wang, Bing Wei., and Seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

533-536

Source:

Czechoslovak Mathematical Journal | 2017 Volume:67 | Number:2

Harvested from:

CDK

Metadata only:

false