An algorithm for finding the Independence Number of a graph

Details An algorithm for finding the Independence Number of a graph An algorithm for finding the Independence Number of a graph

2008-01-03

arxiv.org/abs/0801.0590v4

Computer Science

Discrete Mathematics

15 pages; a corrected proof for the second method is added

Scientific paper

In this paper, we prove that for every connected graph G, there exists a
split graph H with the same independence number and the same order. Then we
propose a first algorithm for finding this graph, given the degree sequence of
the input graph G. Further, we propose a second algorithm for finding the
independence number of G, given the adjacency matrix of G.

Affiliated with

Also associated with

No associations

Rating

An algorithm for finding the Independence Number 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 An algorithm for finding the Independence Number of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for finding the Independence Number of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379114