2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/145534In 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.15 pages; a corrected proof for the second method is addedDiscrete MathematicsData Structures and AlgorithmsF.2.2text