Preferred Language
Articles
/
NBa2lIcBVTCNdQwCVlaz
Connectedness in Graphs and Gm-Closure Spaces
...Show More Authors

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Preview PDF
Quick Preview PDF
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Study of Two Types Finite Graphs in KU-Semigroups
...Show More Authors

      In this Ë‘work, we present theË‘ notion of the Ë‘graph for a KU-semigroup  as theË‘undirected simple graphË‘ with the vertices are the elementsË‘ of  and weË‘Ë‘study the Ë‘graph ofË‘ equivalence classesË‘ofË‘  which is determinedË‘ by theË‘ definition equivalenceË‘ relation ofË‘ these verticesË‘, andË‘ then some related Ë‘properties areË‘ given. Several examples are presented and some theorems are proved. ByË‘ usingË‘ the definitionË‘ ofË‘ isomorphicË‘ graph, Ë‘we showË‘ thatË‘ the graphË‘ of equivalence Ë‘classes Ë‘and the Ë‘graphË‘of Ë‘a KU-semigroup Ë‘  areË‘ theË‘ sameË‘,

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Aug 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Some Estimation Methods Of GM(1,1) Model With Missing Data and Practical Application
...Show More Authors

This paper presents a grey model GM(1,1) of the first rank and a variable one and is the basis of the grey system theory , This research dealt  properties of grey model and a set of methods to estimate parameters of the grey model GM(1,1)  is the least square Method (LS) , weighted least square method (WLS), total least square method (TLS) and gradient descent method  (DS). These methods were compared based on two types of standards: Mean square error (MSE), mean absolute percentage error (MAPE), and after comparison using simulation the best method was applied to real data represented by the rate of consumption of the two types of oils a Heavy fuel (HFO) and diesel fuel (D.O) and has been applied several tests to

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Sep 30 2021
Journal Name
Iraqi Journal Of Science
CutPoints and Separations in Alpha- Connected Topological Spaces
...Show More Authors

     This paper introduces cutpoints and separations in -connected topological spaces, which are constructed by using the union of vertices set and edges set for a connected graph, and studies the relationships between them. Furthermore, it generalizes some new concepts.

View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On Antimagic Labeling for Some Families of Graphs
...Show More Authors

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

View Publication Preview PDF
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
Fri Sep 30 2022
Journal Name
Iraqi Journal Of Science
Face Antimagic Labeling for Double Duplication of Barycentric and Middle Graphs
...Show More Authors

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

View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sun Jul 30 2023
Journal Name
Iraqi Journal Of Science
Some Results on the Generalized Cayley Graph of Complete Graphs
...Show More Authors

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Mar 01 2009
Journal Name
Baghdad Science Journal
On Monotonically T2-spaces and Monotonicallynormal spaces
...Show More Authors

In this paper we show that if ? Xi is monotonically T2-space then each Xi is monotonically T2-space, too. Moreover, we show that if ? Xi is monotonically normal space then each Xi is monotonically normal space, too. Among these results we give a new proof to show that the monotonically T2-space property and monotonically normal space property are hereditary property and topologically property and give an example of T2-space but not monotonically T2-space.

View Publication Preview PDF
Crossref
Publication Date
Thu Dec 08 2022
Journal Name
Aequationes Mathematicae
On graceful antimagic graphs
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Int. J. Nonlinear Anal. Appl.
Feeble regular and feeble normal spaces in α-topological spaces using graph
...Show More Authors

This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.

Preview PDF
Scopus (1)
Scopus Clarivate