On linear and circular structure of (claw, net)-free graphs
We prove that every (claw, net)-free graph contains an induced doubly dominating cycle or a dominating pair. Moreover, using LexBFS we present a linear time algorithm which, for a given (claw, net)-free graph, finds either a dominating pair or an induced doubly dominating cycle. We show also how one can use structural properties of (claw, net)-free graphs to solve efficiently the domination, independent domination, and independent set problems on these graphs.
circular structure dominating cycle independent domination -free graphs linear structure stability number linear-time algorithm