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

Sana Anjum and Amal S. Alali ()
Additional contact information
Sana Anjum: Department of Mathematics, GC University, Faisalabad 38000, Pakistan
Amal S. Alali: Department of Mathematical Sciences, College of Science, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia

Mathematics, 2025, vol. 13, issue 18, 1-13

Abstract: 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.

Keywords: gaps; multiplicity; Frobenius number; independent set; independent number (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/18/2951/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/18/2951/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:18:p:2951-:d:1747967

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().