مواقع التدريسيينجامعة الكوفة
Hanan Hayder Mohammed Alaridhi
Assistant Lecturer

Hanan Hayder Mohammed Alaridhi

0Publications
0Lectures
0Interests

About

Bachelor of Mathematics/Faculty of Education for Girls/ University of Kufa /2014
Master of Mathematics (Graph Theory)/Faculty of Education for Girls/ University of Kufa /2017

Research Interests

3

Publications

4
2026

Chromatic Uniqueness and Equivalence of Generalized Fan Graphs

AuthorsHanan Hayder Mohammed
JournalInternational Journal of Academic Multidisciplinary Research (IJAMR)
Date2026-05-05
Abstract

This paper studies the chromatic uniqueness of the generalized fan graph \mathbit{F}_{\mathbit{n},\mathbit{m}}=\mathbit{O}_\mathbit{n}+ \mathbit{P}_\mathbit{m}, where \mathbit{n}\geq\mathbf{1} and \mathbit{m}\geq\mathbf{2}. The objective is to determine the conditions under which \mathbit{F}_{\mathbit{n},\mathbit{m}}\ is chromatically unique and to classify its equivalence classes. By analyzing the chromatic polynomial, we show that uniqueness is restricted to the small cases: \mathbit{F}_{\mathbit{n},\mathbit{m}},\;\hairsp\mathbit{n}\le\mathbf{2},\;\hairsp\mathbit{m}\le\mathbf{3},\;\hairsp\mathbf{with}\ \mathbit{F}_{\mathbf{1},\mathbf{3}}\cong\mathbit{F}_{\mathbf{2},\mathbf{2}}. For all other parameters, \mathbit{F}_{\mathbit{n},\mathbit{m}}\ is not unique, and infinite families of chromatic equivalences are derived, including \mathbit{F}_{\mathbit{n},\mathbf{2}}\ \sim\mathbit{F}_{\mathbf{1},\mathbit{m}}\ and \mathbit{F}_{\mathbit{n},\mathbf{3}}\sim\mathbit{F}_{\mathbf{2},\mathbit{m}},  \mathbit{m}\geq\mathbit{n}+\mathbf{1}. This provides a complete characterization of the chromatic properties of generalized fan graphs and contributes to the broader theory of join graph invariants.

2026

Cartesian Product and Direct Product of Finite Prime Fuzzy Bd-Ideals of Bd-Algebras

AuthorsEsraa Kareem Kadhim, Huda Qusay Hashim, Hanan Hayder Mohammed
JournalInternational Journal of Latest Technology in Engineering Management & Applied Science
Date2026-04-25
Abstract

Fuzzy Bd-ideals provide a useful framework for studying Bd-algebras. This paper focuses on the Cartesian and direct products of finite prime fuzzy Bd-ideals. We extend the idea of primeness to these constructions and analyze how it behaves under product operations. Key properties of the Cartesian product are obtained, including conditions that keep primeness intact. We also study the direct product case and identify when the prime structure is preserved. These findings give a clearer view of how fuzzy ideals interact within product structures in Bd-algebras.

2017

Chromaticity of Ladder and Book Graphs

AuthorsH. H. Mohammed, A. M. KhalafM. Othman
JournalInternational Journal of Engineering and Information Systems (IJEAIS)
Date2017-07-13
Abstract

Graph colorings is one of the important issues statements that appeared while scientists trying to solve the issue of four colors. Frequently, we are concerned with determining the least number of colors with which we can achieve a proper coloring on a graph. Furthermore, we want to count the possible number of different proper colorings on a graph with a given number of colors. We can calculate each of these values by using a special function that is associated with each graph, called the Chromatic Polynomial. Justifications and reasons for choosing this Search is the frequent applications of the subject in various areas such as chemistry, Nano technology, computer networks, channel assignment, scheduling and numerous different application while still mystery surrounds much of the theoretical aspects of the subject. Research of theoretical and applied research. Either beneficiaries understand graph theory researchers in addition to those interested in computer networks. In this article, we study the chromaticity of ladder and book graphs, which means study chromatically equivalent and chromatically unique of ladder and book graphs. 2010 Mathematics Classification Subject: 05C15.

2024

On Chromaticity of Circulant Graph

AuthorsHanan Hayder Mohammed, Esraa Kareem Kadhim
JournalInternational Journal of Engineering and Information Systems (IJEAIS)
Date2024-08-22
Abstract

Coloring graphs is a fundamental problem that arose during the attempt to resolve the four-color theorem. The main focus lies in finding the minimum number of colors required for a proper graph coloring. Additionally, there is an interest in determining the total count of distinct proper colorings achievable with a specific number of colors on a graph. These values can be computed using the Chromatic Polynomial, a specialized function linked to each graph. Graphs

Lectures

7
View details