Vertices Belonging to All Critical Independent Sets of a Graph

Details Vertices Belonging to All Critical Independent Sets of a Graph Vertices Belonging to All Critical Independent Sets of a Graph

2011-02-02

arxiv.org/abs/1102.0401v2

Computer Science

Discrete Mathematics

9 pages; 4 figures

Scientific paper

Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, and mu(G) is the size of a maximum matching. The number id_{c}(G)=max{|I|-|N(I)|:I is an independent set} is called the critical independence difference of G, and A is critical if |A|-|N(A)|=id_{c}(G). We define core(G) as the intersection of all maximum independent sets, and ker(G)as the intersection of all critical independent sets. In this paper we prove that if a graph G is non-quasi-regularizable (i.e., there exists some independent set A, such that |A|>|N(A)|), then: ker(G) is a subset of core(G), and |ker(G)|> id_{c}(G) >= alpha(G)-mu(G) > 0.

Affiliated with

Also associated with

No associations

Rating

Vertices Belonging to All Critical Independent Sets of a Graph 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 Vertices Belonging to All Critical Independent Sets of a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertices Belonging to All Critical Independent Sets of a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80928