Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition

12/16/2022
by   Martin Milanič, et al.
0

A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the weighted case. Given a graph G, a real-valued vertex weight function w is said to be a well-covered weighting of G if all its maximal independent sets are of the same weight. The set of all well-covered weightings of a graph G forms a vector space over the field of real numbers, called the well-covered vector space of G. Since the problem of recognizing well-covered graphs is 𝖼𝗈-𝖭𝖯-complete, the problem of computing the well-covered vector space of a given graph is 𝖼𝗈-𝖭𝖯-hard. Levit and Tankus showed in 2015 that the problem admits a polynomial-time algorithm in the class of claw-free graph. In this paper, we give two general reductions for the problem, one based on anti-neighborhoods and one based on modular decomposition, combined with Gaussian elimination. Building on these results, we develop a polynomial-time algorithm for computing the well-covered vector space of a given fork-free graph, generalizing the result of Levit and Tankus. Our approach implies that well-covered fork-free graphs can be recognized in polynomial time and also generalizes some known results on cographs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2017

Almost Well-Covered Graphs Without Short Cycles

We study graphs in which the maximum and the minimum sizes of a maximal ...
research
11/11/2018

Generating subgraphs in chordal graphs

A graph G is well-covered if all its maximal independent sets are of the...
research
11/03/2022

Complexity of Simon's problem in classical sense

Simon's problem is a standard example of a problem that is exponential i...
research
08/08/2022

A note on independent sets in sparse-dense graphs

Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwan...
research
11/11/2018

Recognizing generating subgraphs revisited

A graph G is well-covered if all its maximal independent sets are of the...
research
08/30/2018

Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7

Let B be an induced complete bipartite subgraph of G on vertex sets of b...
research
01/21/2021

(α, β)-Modules in Graphs

Modular Decomposition focuses on repeatedly identifying a module M (a co...

Please sign up or login with your details

Forgot password? Click here to reset