Bibliographic Details
| Title: |
An Implementation of the Python Code for Computing the Independent Number of Genus Graphs. |
| Authors: |
Anjum, Sana, Alali, Amal S. |
| Source: |
Mathematics (2227-7390); Sep2025, Vol. 13 Issue 18, p2951, 13p |
| Subject Terms: |
GRAPH theory, INDEPENDENT sets, CANCER treatment, TOPOLOGICAL graph theory, COMPUTATIONAL biology, PYTHON programming language, ALGORITHMS |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mathematics (2227-7390) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science