Preferred Language
Details
Publication Date
Tue Jan 01 2008
Journal Name
Al-mustansiriyah Journal Of Science
Volume
19
Issue Number
3
Choose Citation Style
Statistics
View publication
3
Statistics
Articles
/
1xaoj4cBVTCNdQwC6VXQ
Weakly (resp., Closure, Strongly) Perfect Mappings
weakly perfect mappings
closure perfect mappings
strongly perfect mappings.
Y. Y. Yousif
...Show More Authors

In this paper the concepts of weakly (resp., closure, strongly) Perfect Mappings are defined and the important relationships are studied: (a) Comparison between deferent forms of perfect mappings. (b) Relationship between compositions of deferent forms of perfect mappings. (c) Investigate relationships between deferent forms of perfect mappings and their graphs mappings.

Preview PDF
Quick Preview PDF
Related publications
Publication Date
Sun Jan 07 2018
Journal Name
University Of Baghdad, College Of Education For Pure Sciences / Ibn Al-haitham, Department Of Mathematics
On Topological Structures In Graph Theory
M-space
m-derived graphs
m-open graphs
m-closed graphs
m-interior operators
m-closure operators
M-subspace
o-space
i-space.
SARA SAAD
Y. Y.
...Show More Authors

In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological

... Show More
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Contemporary Mathematical Sciences
Pre-Topology Generated by the Short Path Problems
: Graph theory
Short path problem
Closure operators
j-pre-topology
j = 1
2
j-dependency
j = 1
2.
Restriction
Separators
Rate of liaison.
M.
Y. Y.
...Show More Authors

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

Preview PDF