Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2020
DOI: 10.1088/1742-6596/1591/1/012074
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Rough Digraphs and Related Topologies

Abstract: The primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Let D = (V(D), E(D)) be a finite digraph. The J-degree of , where , for all J {O, I, , , <O>, <I>, < >, < >}is defined by (a) , ( [3] Let D = (V(D), E(D)) be a finite digraph and : V(D) P(V(D)) be a mapping which assigns for all V(D) its J-degree in P(V(D)). The pair (D, ) is namable as a J-degree space (concisely J-DS).…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Let D = (V(D), E(D)) be a finite digraph. The J-degree of , where , for all J {O, I, , , <O>, <I>, < >, < >}is defined by (a) , ( [3] Let D = (V(D), E(D)) be a finite digraph and : V(D) P(V(D)) be a mapping which assigns for all V(D) its J-degree in P(V(D)). The pair (D, ) is namable as a J-degree space (concisely J-DS).…”
Section: Preliminariesmentioning
confidence: 99%
“…The pair (D, ) is namable as a J-degree space (concisely J-DS). Theorem 2.3 [3] If is a J-DS, then the a family , for each , , for all J {O, I, , , <O>, <I>, < >, < >} is a topology on D. Definition 2.4 [3]…”
Section: Preliminariesmentioning
confidence: 99%