مواقع التدريسيينجامعة الكوفة
0Publications
0Lectures
0Interests
0News

About

Haneen Al-Janabi got her Ph.D. degree with honors in Mathematics under the supervision of Hungarian mathematician Dr. Bacsó Gábor from Budapest University of Technology and Economics/ Budapest/ Hungary, in the academic year 2022-2023. She has reviewed more than 20 articles. She has many research articles in applied and computational mathematics, Graph theory. She has supervised postgraduate student in her areas of expertise. She has received grants from Tempus Public Foundation.

She hold a bachelor's degree in mathematics from the Faculty of Science University of KUFA (July 2006), and She hold a master's degree in mathematics science Graph Theory from the Faculty of Mathematics and Computer Sciences University of Kufa (December 2012) and holds a degree in teaching methods, ICDL and IC3.

She is currently a faculty member of the Department of Mathematics the Faculty of Computer Science and Mathematics, University of Kufa, Iraq.

Research interests:
- Studies the Chromaticity and get some graphs Chromatically Unique and Chromatically equivalent.
- Studies some Algebraic Graph.
- Studies the applications in the graph of chemical science.
- Studies the applications in the graph of Internet networks
- Creating and modifying a specialized computer source codes such as and Math LAB, MAPLE and LATEX.

Research Interests

4

Publications

7
2018

The harmonic index of some special graphs and Certain Vertex Gluing Graphs

AuthorsHaneen Kareem Aljanabi
JournalJournal of Kufa for Mathematics and Computer مجلة الكوفة للرياضيات الحاسبات
Abstract

The stability of linear and branched alkanes, as well as strain energy of cycloalkanes, can be reasonably modeled using the harmonic index (H), which is commonly defined as H(G)=∑_(u-v)▒2/(d_u (G)+d_v (G)) where du(G) denotes the degree of vertex u in G. In the current study, general formula is derived for the H index of certain graphs and vertex gluing of graphs.

2017

Schultz index, Modified Schultz index, Schultz polynomial and Modified Schultz polynomial of alkanes

AuthorsHaneen Kareem Aljanabi
JournalGlobal Journal of Pure and Applied Mathematics © Research India Publications
Abstract

The topology of molecule in chemistry can be graphically represented through demonstrating the atoms connection. Using a graph, the atoms are represented by points, while their corresponding covalent bonds are denoted by the edges. A topological index of such graphical modeling is studied to give rise to the numerically graphical parameters. In the current analysis, general formulas are established depending upon some topological indices of alkanes for particular sorts of chemical trees. These indices are Schultz index, Modified Schultz index, Schultz polynomial and Modified Schultz polynomial.

2017

Computing the Harmonic Index for Alkanes, Alkenes and Alkynes‎

AuthorsAbdul Jalil Manshad Khalaf , Haneen Kareem Aljanabi‎ Hussein Abdel Wasi
JournalJournal of Engineering and Applied Sciences
Abstract

Chemical graph theory is one of the branches in mathematical chemistry that uses ‎graph theory as ‎an index for the chemical occurrence. A topological index is a numerical ‎value that describes a chemical structure for ‎many physical and chemical properties. ‎All organic compounds can be considered as hydrocarbons or compounds ‎derived from ‎hydrocarbons. Double bonds as well as atom kinds, i.e. C, N, O, etc., cannot be recognized using simple topological indices, which are defined for only unidirectionally connected graphs. Many topological indices have been developed taking into consideration the state of hybridization for each atom included within the molecule. This article is mainly dedicated to collect most of the data obtained for the chemical and mathematical H indices. In this paper, general formulas are established and then proved for a particular topological index of some trees, which is the ‎harmonic ‎index for alkanes, alkenes, alkynes, ISO – Alkanes (2 – Methyl Alkanes) and ISO – Alkanes (2, 2 – Methyl Alkanes).‎

2022

Chromatic uniqueness of zero-divisor graphs

AuthorsHaneen Al-Janabi, Gábor Bacsó
JournalThe Art of Discrete and Applied Mathematics
Date2022-10-27
Abstract

The zero-divisor graph Π(R) of a commutative ring R is the graph whose vertices are the elements of R such that the vertices u and v are adjacent if and only if uv = 0. If the graphs G and H have the same chromatic polynomial, then we say that they are chromatically equivalent (or χ−equivalent), written as G ∼ H. Suppose a graph is uniquely determined by its chromatic polynomial. Then it is said to be chromatically unique (or χ-unique). In this paper, we discuss the question: For which numbers n is the graph Π(Zn) χ-unique? While Zn is one of the simplest rings, we proved that for any graph A0, for some n, Π(Zn) contains an induced subgraph isomorphic to A0. The first result in the subject states that for n ≥ 10 even, Π(Zn) is not χ-unique (Gehet, Khalaf). By definition, n is square-free if it is prime or the product of different prime numbers. Our main result is the following. If n ≥ 10 is neither square-free nor the square of a prime then it is not χ-unique. Here and in our preceding work, we use a common method. For odd square-free non-prime n, the problem is open, though on the structure of Π(Zn) we know much in this case.

2021

Integral-root polynomials and chromatic uniqueness of graphs

AuthorsHaneen AL-Janabi, Gábor Bacsó
JournalJournal of Discrete Mathematical Sciences & Cryptography
Date2021-05-19
Abstract

For a graph G, a mapping f : V(G) →{1, 2, … , λ}, λ ∈ ℕ, is called a λ-colouring of G if f (u) ≠ f (v), whenever u and v are adjacent. The number of λ-colorings of a graph G is called the chromatic polynomial and denoted by P(G, λ). A polynomial P(G, λ) is called an integral-root polynomial if all its roots are integers. A graph G is an integral-root graph if P(G, λ) is an integral-root polynomial. If P(G, λ) = P(H, λ), then we say that the graphs G and H are (chromatically) equivalent (or χ-equivalent), written as G ∼ H. For any graph H, if G ∼ H implies that G is isomorphic to H, then the graph G is (chromatically) unique (or χ-unique). In this paper, our theorems cover the uniqueness problem for integral-root graphs. Altogether, summarizing them, they state the following. “If the chromatic polynomial of an integral-root graph G has exactly one root of multiplicity 2 and no more multiple root, then it is χ-unique, otherwise, G is not χ-unique”. Finally, we will be able to construct some graphs for any interval-wise integral- root polynomial.

Sanskruti Index of some Chemical Trees and Unicyclic Graphs

AuthorsH Al-Janabi, G Bacsó
JournalJournal of Physics: Conference Series
Abstract

In chemical graph theory, topological indices are used to estimate the bio-activity of chemical compounds. The molecular graph models molecular compounds. A molecular graph represents the structural formula of a chemical compound relative to the graph. Its vertices represent the atoms of the compound, and its edges represent the chemical bonds. In 2017, Hosamani introduced the Sanskruti index S(G) and defined it as S(G) = Σuv∈E(G) ((δu ⋅ δv)/(δu + δv − 2))3, where δu is the sum of the degrees of all neighbors of the vertex u in G. The Sanskruti index displays a good connection with an entropy of octane isomers. In this paper, the Sanskruti index S(G) is computed for some chemical trees and unicyclic graphs.

2021

Sanskruti Index of Some Important Bethe Trees

AuthorsHaneen Al-Janabi, Gábor Bacsó
Journal2021 4th International Conference on Mathematics and Statistics Paris France June 24 - 26, 2021
Date2021-06-21
Abstract

Topological indices are significant, and they have a great part in chemistry. The molecular graph models molecular compounds. The structural formula of a chemical compound relative to the graph can be represented by a molecular graph. The vertices of the graph can represent the compound's atoms, and the edges of the graph can represent its chemical bonds. The Sanskruti index is one of the indices that Hosamani introduced and defined as, where is the sum of the degrees of all neighbors of the vertex in . The Sanskruti index displays a good connection with octane isomers entropy. This study aims to compute the Sanskruti index for some chemical trees: generalized Bethe tree, ordinary Bethe tree, unicyclic Bethe graph, dendrimer, and trees.

Lectures

8

News & Announcements

4
News 2025-02-11

Link in the Budapest university

https://m2.mtmt.hu/api/publication?format=html&sort=publishedYear,desc&cond=authors;eq;10065105&&page=1&labelLang=hun

News 2025-02-11

Link in the Budapest University

https://repozitorium.omikk.bme.hu/items/9936ea9b-b2c7-448d-9fa7-a4dd03d6dbcc

News 2025-02-11

Workshop

https://www.facebook.com/100063736551026/posts/pfbid0D8pjmhLhoEwC7Cv5fgFvtpTKvoreTAUuskSgKsKzwNJMWePFGEa3ZSeiHpM4hbQCl/?app=fbl

News 2025-02-11

Workshop

https://www.facebook.com/100063736551026/posts/pfbid02rTatpXA6fjjWgh9nnhgmRBrUcuVvvxHfLQxNHdaiZk2TNRgeWMuysVTEN7y1JS7Ql/?app=fbl

View details