Directed rough fuzzy graph with application to trade networking

In the realm of linking networks to the real world, connectivity (strength of connectedness) plays a crucial role. In this article, we introduce three types of vertices based on the indegree and outdegree of the vertices of directed rough fuzzy networks (DRFNs). We also define the concept of strength-reducing sets ([Formula: see text] ) of DRF-vertices, DRF-edges, and important related results using the strongest path in directed rough fuzzy graphs (DRFGs). We generalize the idea of Menger’s theorem of vertices and edges in directed fuzzy graphs to directed rough fuzzy graphs which are appropriate for dealing with uncertainty in information systems. Furthermore, we use [Formula: see text] strong DRF-edges, [Formula: see text] strong DRF-edges and [Formula: see text] DRF-edges to identify developing countries most affected by trade deficits during COVID-19. Finally, our research results are compared with existing methods to demonstrate their applicability and productivity.