Preferred Language
Articles
/
jih-2436
Chromatic Number of Pseudo-Von neuman Regular Graph

         Let R be a commutative ring , the pseudo – von neuman  regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if   , this graph denoted by P-VG(R) ,  in this work we got some new results a bout chromatic number of  P-VG(R).

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jul 20 2022
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Some Properties for the Restriction of P^*-field of Sets

The restriction concept is a basic feature in the field of measure theory and has many important properties. This article introduces the notion of restriction of a non-empty class of subset of the power set on a nonempty subset of a universal set. Characterization and examples of the proposed concept are given, and several properties of restriction are investigated. Furthermore, the relation between the P*–field and the restriction of the P*–field is studied, explaining that the restriction of the P*–field is a P*–field too. In addition, it has been shown that the restriction of the P*–field is not necessarily contained in the P*–field, and the converse is true. We provide a necessary condition for the P*–field to obtain th

... Show More
Crossref
View Publication Preview PDF
Publication Date
Sun Dec 05 2010
Journal Name
Baghdad Science Journal
Jordan ?-Centralizers of Prime and Semiprime Rings

The purpose of this paper is to prove the following result: Let R be a 2-torsion free ring and T: R?R an additive mapping such that T is left (right) Jordan ?-centralizers on R. Then T is a left (right) ?-centralizer of R, if one of the following conditions hold (i) R is a semiprime ring has a commutator which is not a zero divisor . (ii) R is a non commutative prime ring . (iii) R is a commutative semiprime ring, where ? be surjective endomorphism of R . It is also proved that if T(x?y)=T(x)??(y)=?(x)?T(y) for all x, y ? R and ?-centralizers of R coincide under same condition and ?(Z(R)) = Z(R) .

Crossref
View Publication Preview PDF
Publication Date
Thu Dec 02 2021
Journal Name
Iraqi Journal Of Science
Equality of Dedekind sums modulo 72Z

According to the wide appearance of Dedekind sums in different applications on different subjects, a new approach for the equivalence of the essential and sufficient condition for ( ) ( ) in and ( ) ( ) in where ( ) Σ(( ))(( )) and the equality of .two .Dedekind sums with their connections is given. The conditions for ( ) ( ) in which is equivalent to ( )– ( ) in were demonstrated with condition that of does not divide . Some applications for the important of Dedekind sums were given.

View Publication
Publication Date
Sat Dec 30 2023
Journal Name
Iraqi Journal Of Science
Derivable Maps of Prime Rings

Our active aim in this paper is to prove the following Let Ŕ be a ring having an
idempotent element e(e  0,e 1) . Suppose that R is a subring of Ŕ which
satisfies:
(i) eR  R and Re  R .
(ii) xR  0 implies x  0 .
(iii ) eRx  0 implies x  0( and hence Rx  0 implies x  0) .
(iv) exeR(1 e)  0 implies exe  0 .
If D is a derivable map of R satisfying D(R )  R ;i, j 1,2. ij ij Then D is
additive. This extend Daif's result to the case R need not contain any non-zero
idempotent element.

View Publication Preview PDF
Publication Date
Sun Jun 01 2014
Journal Name
Baghdad Science Journal
On Higher N-Derivation Of Prime Rings

The main purpose of this work is to introduce the concept of higher N-derivation and study this concept into 2-torsion free prime ring we proved that:Let R be a prime ring of char. 2, U be a Jordan ideal of R and be a higher N-derivation of R, then , for all u U , r R , n N .

Crossref
View Publication Preview PDF
Publication Date
Sun Dec 09 2018
Journal Name
Baghdad Science Journal
Tadpole Domination in Graphs

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

Scopus (29)
Crossref (2)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Sun Mar 17 2019
Journal Name
Baghdad Science Journal
Hn-Domination in Graphs

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

Scopus (48)
Crossref (3)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Mon Apr 23 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Antifungal Activity of Solanum nigrum Extract Against Microsporum canis, The Causative Agent of Ring Worm Disease

    The present study was performed to evaluate the anti-fungal effect of alcoholic extract of Solanum nigrum (AESn) on the growth of Microsporum canis, the causes agent of ring worm. The results of this work referred to the inhibitory effect of the studied extract on the growth of tested fungi. The percentages of inhibition were (7.88 %, 19.88%, 23.41%, 57.65%), in comparison to the control, when (2%, 4%, 6%,8% ) of tested extract were used, respectively. The data illustrated that the higher concentrations of the extract are applied, the more inhibition of fungal growth is produced. 

Crossref (1)
Crossref
View Publication Preview PDF
Publication Date
Mon Mar 15 2021
Journal Name
Egyptian Journal Of Chemistry
Scopus (9)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Fri Sep 30 2022
Journal Name
Iraqi Journal Of Science
Face Antimagic Labeling for Double Duplication of Barycentric and Middle Graphs

This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs 

Scopus (1)
Scopus Crossref
View Publication Preview PDF