Construction of Graphs from the Complement of Discrete Topological Space
Abstract
This paper introduces a new idea for constructing graphs from the complement of the discrete topological space, where many of the properties of the aforementioned topological statement were presented, When the number of elements in a non-empty set is two, the corresponding topological expression aligns with that of a null graph. In cases where the set contains three elements the topology statement is compatible with the circuit statement Moreover, we calculated the independent numbers, chromatic number, girth number, and clique number for Complement discrete topological space.
References
Cvetkovic, Drago," Applications of graph spectra: An introduction to the literature," Application Graph Spectra, 2009. vol. 13, no. 21, pp. 7-31.
Malik, NR. Graph theory with applications to engineering and computer science. Courier Dover Publications, 2017. vol. 13, no.21, pp.1533-1543.
Kettani, Omar, "An algorithm for finding the Independence Number of a graph," arXiv preprint arXiv:0801.0590, 2008.
Idan, Mays K and Abdlhusein, Mohammed A, "Some Dominating Results of the Join and Corona Operations Between Discrete Topological Graphs," Int. J. Nonlinear Anal. Appl. accepted to appear, 2022. Vol.14, no.5, pp. 235—242.
Idan, Mays K and Abdlhusein, Mohammed A, "Different Types of Dominating Sets of the Discrete Topological
Graph," Int. J. Nonlinear Anal. 2023. Appl., vol. 14, no. 1, pp. 101-108.
Jwair, Zainab n and Abdlhusein, Mohammed A, "The Neighborhood Topology Converted from the Undirected Graphs," Proceedings of IAM, 2022. vol. 11, no. 2, pp. 120-128.
Jwair, Zainab N and Abdlhusein, Mohammed A, "Some Dominating Results of the Topological Graph," Int. J. Nonlinear Anal. Appl. accepted to appear, 2022. vol. 14, no. 2, pp. 133-140.
Jwair, Zainab Naeem and Abdlhusein, Mohammed Abdali. "Constructing new topological graph with several properties." Iraqi Journal of Science,2023. pp. 2991-2999.
Abdlhusein, Mohammed A and Al-Harere, Manal N, "New Parameter of Inverse Domination in Graphs," Indian J. Pure Appl. Math. ,2021., vol. 52, no. 1, pp. 281-288,
Liu, Yu and Lu, Jiaheng and Yang, Hua and Xiao, Xiaokui and Wei, Zhewei, "Towards maximum independent sets on massive graphs,". Association for Computing Machinery, 2015. vol. 8, no. 13, pp. 2122-2133
Obayes, Karrar Khudhair and Farawi, Yaqoob A and Obayes, Ghadeer Khudhair, "Using Graphs to Depict Relationships among Elements in Various Topological Spaces",Nanotechnology Perceptions,2024. pp. 800-808.
Poonkuzhali, S and Jayagopal, R. "Dominated coloring in certain networks." Soft Computing, Springer, 2024. pp. 1-9.
Wang, Tao and Yang, Xiaojing. "On odd colorings of sparse graphs." Discrete Applied Mathematics 345, 2024. vol.345, pp. 156-169.
Alaeiyan, Mehdi and Obayes, Karrar Khudhair and Alaeiyan, Mohammadhadi.''Prediction nullity of graph using data mining".Results in Nonlinear Analysis,2023. vol. 6, no. 2, pp. 1-8.
Jwair, Zainab Naeem, and Mohammed Abdali Abdlhusein. "Constructing new topological graph with several properties." ,Iraqi Journal of Science , 2023.pp. 2991-2999.
Dharwadker, Ashay, "The Independent Set Algorithm," Institute of Mathematics, H-501 PalamVihar,2006.
[Online].Available: https://www.dharwadker.org/independent_set/main.html. [Accessed 1 1 2023].
Maus, Yannic. "Distributed graph coloring made easy." ACM Transactions on Parallel Computing ,2023. vol. 10, no. 4, pp. 1-12.
Cho, Eun-Kyung, et al. "Odd coloring of sparse graphs and planar graphs." Discrete Mathematics ,2023 . vol. 346, no. 5, pp. 113305.
Kiss, György, Štefko Miklavič, and Tamás Szőnyi. "On girth-biregular graphs." Ars mathematica contemporanea ,2023. vol. 23, no. 4, pp. P4-01.
Garrett, Henry. Clique Number in Neutrosophic Graphs. Dr. Henry Garrett, 2023.