Extensions of Factor, Signal-Flow, Control-Flow, Dataflow, and PERT/CPM Graphs to Hypergraphs and Superhypergraphs with Illustrative Applications in Engineering and Intelligent Computing
DOI:
https://doi.org/10.66972/iscis21202627Keywords:
Superhypergraph, Hypergraph, Factor graph, Signal flow graph, Control flow graph, Dataflow graph, PERT/CPMAbstract
Graphs represent pairwise relations through vertices and edges, whereas hypergraphs capture multi-way interactions by allowing each hyperedge to connect an arbitrary number of vertices. Superhypergraphs extend this representation through an iterated powerset construction, enabling nested, multi-level relations in which set-valued objects serve as higher-order entities. This paper develops a unified framework for extending five widely used graph models—factor graphs, signal flow graphs, control flow graphs, dataflow graphs, and PERT/CPM networks—to hypergraphs and superhypergraphs. For each model, we present a uniform lifting principle, formal definitions of the corresponding hypergraph and n-superhypergraph structures, and illustrative examples showing how multi-way interactions and hierarchical dependencies can be represented. We also establish that the classical graph models are embedded as special cases of the proposed frameworks. These constructions provide a theoretical foundation for multi-level dependency modeling across inference, dynamical systems, program analysis, streaming computation, and project scheduling, with computational implementation and empirical validation remaining directions for future research.
Downloads
References
Feng, Y., You, H., Zhang, Z., Ji, R., & Gao, Y. (2019). Hypergraph neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, 33(1), 3558–3565. https://arxiv.org/abs/1809.09401
Cai, D., Song, M., Sun, C., Zhang, B., Hong, S., & Li, H. (2022). Hypergraph structure learning for hypergraph neural networks. In IJCAI (pp. 1923–1929). https://doi.org/10.24963/ijcai.2022/267
Karypis, G. (2003). Multilevel hypergraph partitioning. In Multilevel optimization in VLSICAD (pp. 125–154). Springer. https://doi.org/10.1007/978-1-4757-3748-6_3
Fujita, T., Das, A. K., Das, S., & Mondal, S. P. (2026). Anti-fuzzy hypergraphs and superhypergraphs: Max-oriented uncertainty models for higher-order and hierarchical networks. Sustainable Machine Intelligence Journal, 14(3). https://doi.org/10.63689/3005-3617.1095
Shareef, M. P., Jose, B. R., & Mathew, J. (2026). LLM-semantic enrichment of neutrosophic fuzzy hypergraphs for indeterminacy-driven reinforcement learning and explainable path-based recommendations. IEEE Access. Advance online publication. https://doi.org/10.1109/ACCESS.2026.3715708
Shareef, M. P., Jose, B. R., Mathew, J., & PB, R. (2025). Indeterminacy-driven trade-off in reinforcement learning on neutrosophic fuzzy hypergraphs for explainable item recommendation with path-compliant rewards. IEEE Transactions on Emerging Topics in Computational Intelligence. Advance online publication. https://doi.org/10.1109/TETCI.2025.3616051
Smarandache, F. (2022). Introduction to the n-superhypergraph—The most general form of graph today. Infinite Study. https://fs.unm.edu/NSS/n-SuperHyperGraph.pdf
Hamidi, M., Smarandache, F., & Davneshvar, E. (2022). Spectrum of superhypergraphs via flows. Journal of Mathematics, 2022(1), Article 9158912. https://doi.org/10.1155/2022/9158912
Ghods, M., Rostami, Z., & Smarandache, F. (2022). Introduction to neutrosophic restricted superhypergraphs and neutrosophic restricted superhypertrees and several of their properties. Neutrosophic Sets and Systems, 50, 480–487.
Hamidi, M., & Taghinezhad, M. (2023). Application of superhypergraphs-based domination number in real world. Infinite Study. https://doi.org/10.22103/jmmr.2023.21203.1415
Fujita, T., & Smarandache, F. (2026a). Foundations of fuzzy, neutrosophic, plithogenic, and uncertain superhypergraphs: A unified framework for modeling hierarchical and uncertainty-aware graph structures in decision-making and real-world applications. International Journal of Research in Industrial Engineering. Advance online publication. https://doi.org/10.22105/riej.2026.549395.1695
Diestel, R. (2024). Graph theory. Springer.
Bretto, A. (2013). Hypergraph theory: An introduction. Springer. https://doi.org/10.1007/978-3-319-00080-0
Smarandache, F. (2020). Extension of hypergraph to n-superhypergraph and to plithogenic n-superhypergraph, and extension of hyperalgebra to n-ary (classical-/neutro-/anti-) hyperalgebra. Infinite Study. https://fs.unm.edu/NSS/n-SuperHyperGraph-n-HyperAlgebra.pdf
Schwartz, I., Yu, S., Hazan, T., & Schwing, A. G. (2019). Factor graph attention. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 2039–2048). https://experts.illinois.edu/en/publications/factor-graph-attention/
Dellaert, F. (2021). Factor graphs: Exploiting structure in robotics. Annual Review of Control, Robotics, and Autonomous Systems, 4(1), 141–166. https://doi.org/10.1146/annurev-control-061520-010504
Frey, B. J., Kschischang, F. R., Loeliger, H.-A., & Wiberg, N. (1997). Factor graphs and algorithms. In Proceedings of the Annual Allerton Conference on Communication Control and Computing (Vol. 35, pp. 666–680). https://doi.org/10.1109/ITNW.1999.814338
Veerachary, M. (2004). General rules for signal flow graph modeling and analysis of DC-DC converters. IEEE Transactions on Aerospace and Electronic Systems, 40(1), 259–271. https://doi.org/10.1109/TAES.2004.1292158
Huggins, W. H. (2007). Signal-flow graphs and random signals. Proceedings of the IRE, 45(1), 74–86. https://doi.org/10.1109/JRPROC.1957.278301
Devkota, S. (2021). Visualizing control flow graphs [Doctoral dissertation, The University of Arizona]. ProQuest. https://www.proquest.com/openview/9f155dec6041a24b75b071c087056baa/1
Arlt, S., Rümmer, P., & Schäf, M. (2013). A theory for control-flow graph exploration. In Automated Technology for Verification and Analysis: 11th International Symposium, ATVA 2013 (pp. 506–515). Springer. https://doi.org/10.1007/978-3-319-02444-8_44
Bhattacharyya, S. S., Deprettere, E. F., & Theelen, B. D. (2013). Dynamic dataflow graphs. In Handbook of Signal Processing Systems (pp. 905–944). Springer. https://doi.org/10.1007/978-3-319-91734-4_32
Lee, E. A. (1991). Consistency in dataflow graphs. IEEE Transactions on Parallel and Distributed Systems, 2(2), 223–235. https://doi.org/10.1109/71.89067
Schneider, K., & Bhagyanath, A. (2023). Consistency constraints for mapping dataflow graphs to hybrid dataflow/von Neumann architectures. ACM Transactions on Embedded Computing Systems, 22(5), 1–25. https://doi.org/10.1145/3607869
Mazlum, M., & Güneri, A. F. (2015). CPM, PERT and project management with fuzzy logic technique and implementation on a business. Procedia - Social and Behavioral Sciences, 210, 348–357. https://doi.org/10.1016/j.sbspro.2015.11.378
Gao, Y., Zhang, Z., Lin, H., Zhao, X., Du, S., & Zou, C. (2020). Hypergraph learning: Methods and practices. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(5), 2548–2566. https://doi.org/10.1109/TPAMI.2020.3039374
Valencia, E. M. C., Vásquez, J. P. C., & Lois, F. Á. B. (2025). Multineutrosophic analysis of the relationship between survival and business growth in the manufacturing sector of Azuay province, 2020–2023, using plithogenic n-superhypergraphs. Neutrosophic Sets and Systems, 84, 341–355. https://digitalrepository.unm.edu/nss_journal/vol84/iss1/28/
Hamidi, M., Smarandache, F., & Taghinezhad, M. (2023). Decision making based on valued fuzzy superhypergraphs. Infinite Study. https://fs.unm.edu/ScArt/DecisionMakingBasedSuperhypergraphs.pdf
Marcos, B. V. S., Willner, M. F., Rosa, B. V. C., Yissel, F. F. R. M., Roberto, E. R., Puma, L. D. B., & Fernández, D. M. M. (2025). Using plithogenic n-superhypergraphs to assess the degree of relationship between information skills and digital competencies. Neutrosophic Sets and Systems, 84, 513–524. https://doi.org/10.5281/zenodo.15641273
Zhu, S. (2025). Neutrosophic n-superhypernetwork: A new approach for evaluating short video communication effectiveness in media convergence. Neutrosophic Sets and Systems, 85, 1004–1017. https://fs.unm.edu/NSS/58ShortVideo.pdf
Berge, C. (1984). Hypergraphs: Combinatorics of finite sets (Vol. 45). Elsevier.
Smarandache, F. (2023). Superhyperfunction, superhyperstructure, neutrosophic superhyperfunction and neutrosophic superhyperstructure: Current understanding and future directions. Infinite Study. https://doi.org/10.61356/j.nswa.2023.115
Das, A. K., Das, R., Das, S., Debnath, B. K., Granados, C., Shil, B., & Das, R. (2025). A comprehensive study of neutrosophic superhyper BCI-semigroups and their algebraic significance. Transactions on Fuzzy Sets and Systems, 8(2), 80. https://doi.org/10.71602/tfss.2025.1198050
Fujita, T., & Smarandache, F. (2026b). Hypergraph and superhypergraph theory with applications. Neutrosophic Science International Association (NSIA) Publishing House.
Theiling, H. (2002). Control flow graphs for real-time systems analysis [Doctoral dissertation, Universität des Saarlandes].
Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8(3), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X
Broumi, S., Talea, M., Bakali, A., & Smarandache, F. (2016a). Single valued neutrosophic graphs. Journal of New Theory, (10), 86–101.
Broumi, S., Talea, M., Bakali, A., & Smarandache, F. (2016b). Interval valued neutrosophic graphs. Critical Review, XII, 5–33. https://fs.unm.edu/IntervalValuedNeutrosophicGraphs-CR12.pdf
Smarandache, F. (2018). Plithogeny, plithogenic set, logic, probability, and statistics. arXiv preprint arXiv:1808.03948.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Takaaki Fujita, Ajoy Kanti Das, Arif Mehmood, Arkan A. Ghaib (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
All site content, except where otherwise noted, is licensed under the 