TARU PUBLICATIONS
Author

Khalid Sh. Al’Dzhabri

Department οf Mathematics, College of Education, Cοllege οf Educatiοn, University οf Al-Qadisiyah, Al Diwaniyah, 58002, Iraq

Published papers
4
Citations
1
Views
905
Downloads
509

Publications

4 papers
Open Access Research Article·pp. 469–474·Vol. 28, Issue 2Mar 2025

Admixture vertex edges system and A-space

Hassan H. Fandy, Khalid Sh. Al’Dzhabri

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2211

In this paper: The admixture vertex edges system is the central idea of this paper, which are used serve to present, the new space called A-space. We present the essential and required foundation for the ideas of A-...

AbstractReferencesFull Text PDF (496 KB)Views: 223Downloads: 124Citations: 0
Open Access Research Article·pp. 333–340·Vol. 28, Issue 2Mar 2025

Οn digclοsure οperatοrs

Husseins Alοffie, Yοusief S. Eassa, Khalid Sh. Al’Dzhabri

Published Online: 21 Mar 2025DOI: 10.47974/JDMSC-1869

In this paper: The purpοse οf this study is tο use a nοvel definitiοn οf the⨮IGm-clοsure οperatοr οn οut-linked digs tο prοduce cοnstructiοn οf tοpοlοgy οn the pοwer set οf vertices οf digs. Sοme tοpοlοgical structu...

AbstractReferencesFull Text PDF (570 KB)Views: 144Downloads: 122Citations: 0
Open Access Research Article·pp. 253–260·Vol. 28, Issue 1Feb 2025

New closure operators associated with digraphs

Ahmed Raad Hassan, Hayder Ismael Neamah, Khalid Sh. Al’Dzhabri

Published Online: 13 Feb 2025DOI: 10.47974/JIM-1855

In this paper: The Aim of this research is to apply a new definition of the ÇlΓn-closure operators to create the topology construction on the power set of edges of digrs using closure operator on an out-linked digr....

AbstractReferencesFull Text PDF (429 KB)Views: 184Downloads: 133Citations: 0
Open Access Research Article·pp. 1329–1340·Vol. 26, Issue 6Sep 2023

On enumeration of labeled connected transitive digraphs

Khalid Sh. Al’Dzhabri, V. I. Rodionov

Published Online: 08 Sep 2023DOI: 10.47974/JIM-1631

In this paper: If Tc0(n) is the number of all labeled connected transitive digraphs defined on a set of n elements, then the formula Tc0(n) = S pˉ = (p1, ..., pk)| = n (-1)n-k (np) W c (pˉ)  is true. The summation i...

AbstractReferencesFull Text PDF (202 KB)Views: 354Downloads: 130Citations: 1