Karci, SeydaAri, AliKarc, Ali2024-08-042024-08-0420221300-18841304-4915https://doi.org/10.17341/gazimmfd.902093https://search.trdizin.gov.tr/yayin/detay/508622https://hdl.handle.net/11616/92643Purpose: The aim of this paper is to develop algorithms for obtaining independent set in given graph and determine upper bounds for |I| in claw-free graphs. Theory and Methods: The main aim of this paper is to develop algorithms for obtaining near-optimal independent set for any type of graph. A special spanning tree (Kmin) is used for this aim. Kmin is used to obtain the fundamental cut-sets of graphs, and cut-set matrix. The multiplication of incidence matrix and transpose of cut-set matrix gives the first independent set element which has minimum independence number. The Kmin tree is also used to determine the upper bounds for size of independent set in term of minimum degree. Results: The developed algorithms are used for obtaining near-maximum independent set for any given graphs, and this case is the advantage of this algorithm. The Kmin spanning tree is used to obtain the upper bounds for size of independent set, and the obtained inequality is in term of minimum degree in graph. Conclusion: The developed method obtains the near-maximum independent set for any graph type. The upper bound for size of independent set is obtained based Kmin and minimum degree in graph.eninfo:eu-repo/semantics/openAccessIndependent setSpanning TreeFundamental cut-setsKmin treeArticle3731553156410.17341/gazimmfd.9020932-s2.0-85128723730Q2508622WOS:000834843300029Q4