Graph theory models relationships by representing entities as vertices and their interactionsas edges. To handle directionality and multiple head–tail assignments, various extensions—directed, bidirected, and multidirected graphs—have been introduced, with the multidirected graph unifying the first two. In this work, we further enrich this landscape by proposing the Multidirected hypergraph, which merges the flexibility of hypergraphs and superhypergraphs to describe higher-order and hierarchical connections. Building on this, we introduce five uncertainty-aware Multidirected frameworks—fuzzy, neutrosophic, plithogenic, rough, and soft multidirected graphs—by embedding classical uncertainty models into the Multidirected setting. We outline their formal definitions, examine key structural properties, and illustrate each with examples, thereby laying groundwork for future advances in uncertain graph analysis and decision-making.
No takes yet. Share an insight, caveat, or question.
Takaaki Fujita (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: