Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7

Details Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7 Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7

2009-01-07

arxiv.org/abs/0901.0858v4

Computer Science

Discrete Mathematics

10 pages

Scientific paper

A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is w-well-covered if all maximal independent sets of G are of the same weight. The set of weight functions w for which a graph is w-well-covered is a vector space. We prove that finding the vector space of weight functions under which an input graph is w-well-covered can be done in polynomial time, if the input graph does not contain cycles of length 4, 5, 6 and 7.

Affiliated with

Also associated with

No associations

Rating

Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720505