Volume 5 • Issue 1 • PP: 14–22 • 2025
HyperWeighted Graph, SuperHyperWeighted Graph, and MultiWeighted Graph
Open Access & Copyright
© 2025 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
Abstract
A weighted graph is a graph in which each edge is assigned a numerical value (weight), typically representing cost, distance, or intensity. In this paper, we revisit and further explore three generalizations of weighted graphs: the Hyperweighted Graph, the Superhyperweighted Graph, and the MultiWeighted Graph. These advanced structures were initially introduced in.10 Our objective is to enhance understanding and broaden awareness of their theoretical foundations and potential applications through renewed analysis and formal refinement
Keywords
References
[1] P. Bauer, A. Thorpe, and G. Brunet, “The quiet revolution of numerical weather prediction,” Nature, vol. 525, no. 7567, pp. 47–55, 2015.
[2] C. Berge, “Hypergraphs: Combinatorics of finite sets,” Elsevier, vol. 45, 1984.
[3] A. Bretto, “Hypergraph theory: An introduction,” Mathematical Engineering, Springer, Cham, vol. 1, 2013.
[4] A. Buck and J. M. Keller, “Evaluating path costs in multi-attributed fuzzy weighted graphs,” in 2019 IEEE International Conference on Fuzzy Systems (FUZZIEEE), pp. 1–6, 2019.
[5] E. Çakir, Z. Ulukan, and T. Acarman, “Shortest fuzzy hamiltonian cycle on transportation network using minimum zertex degree and time-dependent dijkstra’s algorithm,” IFAC-PapersOnLine, vol. 54, no. 2, pp. 348–353, 2021.
[6] R. Z. Farahani, E. Miandoabchi, W. Y. Szeto, and H. Rashidi, “A review of urban transportation network design problems,” European Journal of Operational Research, vol. 229, no. 2, pp. 281–302, 2013.
[7] Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 3558– 3565, 2019.
[8] H. Garrett, “Properties of neutrosophic superhypergraph,” Dr. Henry Garrett, 122 pages, 2023.
[9] L. Gou and Y. Zhong, “A new fault diagnosis method based on attributes weighted neutrosophic set,” IEEE Access, vol. 7, pp. 117740–117748, 2019.
[10] J. A. Jiménez González and A. Mróz, “Bidirected graphs, integral quadratic forms and some diophantine equations,” 2023.
[11] N. Kita, “Bidirected graphs i: Signed general kotzig– lovász decomposition,” arXiv: Combinatorics, 2017.
[12] A. C. Lorenc, “Analysis methods for numerical weather prediction,” Quarterly Journal of the Royal Meteorological Society, vol. 112, no. 474, pp. 1177–1194, 1986.
[13] T. Ma and M. Tang, “Weighted rough set model,” in Sixth International Conference on Intelligent Systems Design and Applications, vol. 1, IEEE, pp. 481–485, 2006.
[14] S. Mathew and M. S. Sunitha, “Cycle connectivity in weighted graphs,” Proyecciones (Antofagasta), vol. 30, no. 1, pp. 1–17, 2011.
[15] H. S. Own, N. Abd Al Aal, and A. Abraham, “A new weighted rough set framework for imbalance class distribution,” in 2010 International Conference of Soft Computing and Pattern Recognition, IEEE, pp. 29–34, 2010.
[16] T. Pathinathan and P. Mahimairaj, “Weighted fuzzy sets,” International Journal of Technology and Engineering, vol. 8, no. 5, pp. 766–769, 2020.
[17] D. Riordan and B. K. Hansen, “A fuzzy case-based system for weather prediction,” Engineering Intelligent Systems for Electrical Engineering and Communications, vol. 10, no. 3, pp. 139–146, 2002.
[18] Y. Sheffi, H. Mahmassani, and W. B. Powell, “A transportation network evacuation model,” Transportation Research Part A: General, vol. 16, no. 3, pp. 209–218, 1982.
[19] F. Smarandache, “Extension of hyperalgebra to superhyperalgebra and neutrosophic superhyperalgebra (revisited),” in International Conference on Computers Communications and Control, Springer, pp. 427–432, 2022.
[20] Florentin Smarandache, “Foundation of the superhypersoft set and the fuzzy extension superhypersoft set: A new vision,” Neutrosophic Systems with Applications, vol. 11, pp. 48–51, 2023.
[21] F. Smarandache and M. Ali, “Interval valued bipolar fuzzy weighted neutrosophic sets and their application,” A A, vol. 10, no. 1, p. 2, 2016.
[22] X. Wen, “Weighted hesitant fuzzy soft set and its application in group decision making,” Granular Computing, vol. 8, pp. 1583–1605, 2023.
[23] J. Yang and J. Y.-T. Leung, “A generalization of the weighted set covering problem,” Naval Research Logistics (NRL), vol. 52, no. 2, pp. 142–149, 2005.
[24] F. Zhang, M. Jiang, and S. Wang, “Efficient dynamic weighted set sampling and its extension,” Proceedings of the VLDB Endowment, vol. 17, no. 1, pp. 15–27, 2023.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.