Preferred Language
Articles
/
aBa3i4cBVTCNdQwCBVVo
Closure Operators on Graphs
...Show More Authors

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Aug 16 2021
Journal Name
Al-qadisiyah Journal Of Pure Science
Pairwise Lower Separation Axioms in C ̌ech Fuzzy Soft Bi-Closure Spaces
...Show More Authors

The idea of ech fuzzy soft bi-closure space ( bicsp) is a new one, and its basic features are defined and studied in [1]. In this paper, separation axioms, namely pairwise, , pairwise semi-(respectively, pairwise pseudo and pairwise Uryshon) - fs bicsp's are introduced and studied in both ech fuzzy soft bi-closure space and their induced fuzzy soft bitopological spaces. It is shown that hereditary property is satisfied for , with respect to ech fuzzy soft bi-closure space but for other mentioned types of separations axioms, hereditary property satisfies for closed subspaces of ech fuzzy soft bi-closure space.

View Publication
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
g-Closed Soft Sets in Soft Closure Spaces
...Show More Authors
Abstract<p>The aim of the present work is to define a new class of closed soft sets in soft closure spaces, namely, generalized closed soft sets (<italic>gc</italic>-soft sets, for short) which are defined over an initial universe set with a fixed set of parameters. This new class is a generalization to the class of closed soft sets. A necessary condition for a <italic>gc</italic>-soft set to be a soft closed is also obtainable. Moreover, the union and intersection of two <italic>gc</italic>-soft sets are discussed. Besides, some properties of <italic>gc</italic>-soft sets in the product soft closure spaces are also studied. Also, as an application of <jat></jat></p> ... Show More
View Publication
Scopus Crossref
Publication Date
Fri May 01 2020
Journal Name
Journal Of Physics: Conference Series
The Product of Automorphic Weighted Composition Operators on Hardy Space H <sup>2</sup>
...Show More Authors
Abstract<p>Let <inline-formula> <tex-math><?CDATA $n\in {\mathbb{N}},{p}_{i}\in {\rm{U}},{\alpha }_{{P}_{i}}(z)=\frac{{p}_{i}-z}{1-{\bar{p}}_{i}z}(z\in {\rm{U}})$?></tex-math> <math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mrow> <mi>n</mi> <mo>∈</mo> <mi>ℕ</mi> <mo>,</mo> <msub> <mi>p</mi> <mi>i</mi> </msub></mrow></math></inline-formula></p> ... Show More
View Publication
Scopus Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Baghdad Science Journal
Forgotten Index and Forgotten Coindex of Graphs
...Show More Authors

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Stability of Complement Degree Polynomial of Graphs
...Show More Authors

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sun Mar 07 2010
Journal Name
Baghdad Science Journal
Hypercyclictty and Countable Hypercyclicity for Adjoint of Operators
...Show More Authors

Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .

View Publication Preview PDF
Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph
...Show More Authors

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Fri Mar 01 2019
Journal Name
Al-khwarizmi Engineering Journal
Study The Influence of Forming Conditions Like Deformation Speed on Void Closure in Open Die Forging
...Show More Authors

This paper presents an investigation to the effect of the forming speed on healing voids that inhabit at various size in an ingot. The study was performed by using finite element method with bilinear isotropic material option, circular type voids were considered. The closure index was able to predict the minimum press force necessary to consolidate voids and the reduction. The simulation was carried out, on circular cross-section lead specials containing a central void of different size. At a time with a flat die, different ratio of inside to outside radius was taken with different speed to find the best result of void closure.

View Publication Preview PDF
Publication Date
Thu Dec 01 2022
Journal Name
Journal Of Environmental Engineering And Science
Performance evaluation of coronavirus closure on air quality over central, southern and northern parts of Iraq
...Show More Authors

When the number of confirmed coronavirus disease cases rose in Iraq in the middle of February 2021, the Iraqi government performed a closure approach to constrain mobility and factory operations and enforce social distancing. In this research, the concentrations of air components (PM2.5, PM10, nitrogen dioxide (NO2) and ozone (O3)), which represent herein the degree of air quality index, were recorded, drawn and evaluated over central (Baghdad, the capital), northern (Kirkuk Province) and southern (Basra Province) Iraq before and during the closure. The experimental duration of this research was 6 months (from 1 January 2021 to 30 June 2021), which

... Show More
View Publication
Scopus (2)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Fractional Local Metric Dimension of Comb Product Graphs
...Show More Authors

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (1)
Scopus Clarivate Crossref