An Implementation of the Python Code for Computing the Independent Number of Genus Graphs

The computation of the independent number is a fundamental problem in graph theory. It has many applications, including route planning, computer graphics, network analysis, computational biology, and network architecture. Particularly in computational biology, it provides a powerful mathematical tool for modeling tumor robustness and optimizing cancer treatment. In this article, an algorithmic method for computing the independent number of genus graphs is presented. Moreover, a Python (version 3.10.5) implementation has been provided for constructing genus graphs and computing their independent number.