An algorithm for finding the Independence Number of a graph
Discrete Mathematics
2008-01-09 v4 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.0801.0590,
title = {An algorithm for finding the Independence Number of a graph},
author = {Omar Kettani},
journal= {arXiv preprint arXiv:0801.0590},
year = {2008}
}
Comments
15 pages; a corrected proof for the second method is added