TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Utilizing line graph construction in combinatorial analysis for network optimization

, * , , , ,

* Corresponding author · click or hover a name for details

pp. 307–315Vol. 29Issue 1January 2026DOI: 10.47974/JDMSC-2488 Crossmark XML
Received:
07 May 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2488
Pages:
307–315

Abstract

This study examines how combinatorial analysis may address network optimization challenges via line graph creation. Line graphs, which can transform graphs, underpin graph theory. Points in a line graph indicate the first graph’s edges. Using this modification, we examine how network configurations might be improved for efficiency, cost reduction, and resource utilization. We tackle power, information, and transportation network challenges via line graph creation. The study uses theory and real-world examples to demonstrate how line graphs may simplify network optimization. It also discusses line graphs’ computational advantages for huge networks and their potential usage in IoT and smart communities. Line graphs may improve network systems in many combinatorial circumstances, as shown by the findings.

Keywords

Subject Classifications

05A10

References

[1] J. Sun, X. J. Gan, D. W. Gong, X. K. Tang, H. W. Dai, and Z. M. Zhong, “A self-evolving fuzzy system online prediction-based dynamic multi-objective evolutionary algorithm,” Inf. Sci., vol. 612, pp. 638–654 (2022).
[2] X. J. Gan, J. Sun, D. W. Gong, D. B. Jia, H. W. Dai, and Z. M. Zhong, “An adaptive reference vector based interval multi-objective evolutionary algorithm,” IEEE Trans. Evol. Comput., vol. 27, pp. 1235–1249 (2023).
[3] C. Badica and A. Popa, “Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes,” Simul. Model. Pract. Theory, vol. 127, pp. 102777 (2023).
[4] S. Gao, Y. Yu, Y. Wang, J. Wang, J. Cheng, and M. Zhou, “Chaotic local search-based differential evolution algorithms for optimization,” IEEE Trans. Syst., Man, Cybern.: Syst., vol. 51, pp. 3954–3967 (2021).
[5] W. Wu, M. Ito, Y. Hu, H. Goko, M. Sasaki, and M. Yagiura, “Heuristic algorithms based on column generation for an online product shipping problem,” Comput. Oper. Res., vol. 161, pp. 106403 (2024).
[6] C. Quadri, A. Ceselli, and G. P. Rossi, “Multi-user edge service orchestration based on deep reinforcement learning,” Comput. Commun., vol. 203, pp. 30–47 (2023).
[7] J. C. Vanikar, S. B. Patil, A. S. Banait, V. Khetani, G. Gondhalekar, and Y. Gandhi, “Shaping the future of leadership through the complex role of management sciences,” J. Inf. Optim. Sci., vol. 46, no. 4-B, pp. 1189–1198 (2025).
[8] D. B. Jia, W. X. Xu, D. Z. Liu, Z. X. Xu, Z. M. Zhong, and X. X. Ban, “Verification of classification model and dendritic neuron model based on machine learning,” Discrete Dyn. Nat. Soc., vol. 2022, Art. ID 3259222 (2022).
[9] X. Lin, Z. Yang, and Q. Zhang, “Pareto set learning for neural multi-objective combinatorial optimization,” arXiv preprint, arXiv:2203.15386 (2022).
[10] K. Li, T. Zhang, and R. Wang, “Deep reinforcement learning for multiobjective optimization,” IEEE Trans. Cybern., vol. 51, pp. 3103–3114 (2020).

Views: 74Downloads: 9Citations: 0